Sciweavers

2076 search results - page 195 / 416
» Functional logic overloading
Sort
View
JAR
2008
105views more  JAR 2008»
15 years 6 months ago
Proof Synthesis and Reflection for Linear Arithmetic
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
Amine Chaieb, Tobias Nipkow
APIN
1998
78views more  APIN 1998»
15 years 6 months ago
The Method of Assigning Incidences
Incidence calculus is a probabilistic logic in which incidences, standing for the situations in which formulae may be true, are assigned to some formulae, and probabilities are as...
Weiru Liu, David McBryan, Alan Bundy
SIGSOFT
2010
ACM
15 years 1 months ago
Language-based verification will change the world
We argue that lightweight, language-based verification is poised to enter mainstream industrial use, where it will have a major impact on software quality and reliability. We expl...
Tim Sheard, Aaron Stump, Stephanie Weirich
FM
2011
Springer
357views Formal Methods» more  FM 2011»
14 years 10 months ago
TraceContract: A Scala DSL for Trace Analysis
Abstract. In this paper we describe TRACECONTRACT, an API for trace analysis, implemented in the SCALA programming language. We argue that for certain forms of trace analysis the b...
Howard Barringer, Klaus Havelund
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
16 years 3 months ago
To SAT or not to SAT: Ashenhurst decomposition in a large scale
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
Hsuan-Po Lin, Jie-Hong Roland Jiang, Ruei-Rung Lee