2488 search results - page 199 / 498 » An improvement in formal verification |
127
click to vote
WFLP
2000
Springer
15 years 4 months ago
2000
Springer
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
120
click to vote
AO
2006
15 years 1 months ago
2006
Large software systems are modularized in order to improve manageability. The parts of the software system communicate in order to achieve the desired functionality. To better und...
106
click to vote
DAC
2009
ACM
16 years 2 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
103
click to vote
SIGSOFT
2005
ACM
16 years 2 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
101
click to vote
CADE
2008
Springer
16 years 1 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...