126 search results - page 24 / 26 » An Extension to Pointer Logic for Verification |
DATE
2000
IEEE
14 years 6 days ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
ERLANG
2007
ACM
13 years 11 months ago
2007
ACM
We propose a small extension of the ERLANG language that allows programmers to specify contracts with type information at the level of individual functions. Such contracts are opt...
FMICS
2010
Springer
13 years 5 months ago
2010
Springer
Mutual exclusion protocols are an essential building block of concurrent systems: indeed, such a protocol is required whenever a shared resource has to be protected against concurr...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...