Sciweavers

4502 search results - page 718 / 901
» Regular Model Checking
Sort
View
127
Voted
LPNMR
2005
Springer
15 years 10 months ago
Guarded Open Answer Set Programming
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
15 years 10 months ago
SATABS: SAT-Based Predicate Abstraction for ANSI-C
SAT-based Predicate Abstraction for ANSI-C Edmund Clarke1 Daniel Kroening2 Natasha Sharygina1,3 Karen Yorav4 1 Carnegie Mellon University, School of Computer Science 2 ETH Zuerich,...
Edmund M. Clarke, Daniel Kroening, Natasha Sharygi...
116
Voted
COOPIS
2003
IEEE
15 years 10 months ago
What Must (Not) Be Available Where?
Arranging the distribution of data, objects or components is a critical task that can ultimately affect the performance, integrity and reliability of distributed system. This pape...
Felix Bübl
DATE
2003
IEEE
98views Hardware» more  DATE 2003»
15 years 10 months ago
Using Formal Techniques to Debug the AMBA System-on-Chip Bus Protocol
System-on-chip (SoC) designs use bus protocols for high performance data transfer among the Intellectual Property (IP) cores. These protocols incorporate advanced features such as...
Abhik Roychoudhury, Tulika Mitra, S. R. Karri
114
Voted
FOSSACS
2003
Springer
15 years 10 months ago
When Ambients Cannot Be Opened
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
Iovka Boneva, Jean-Marc Talbot