Sciweavers

1157 search results - page 187 / 232
» Descriptive Complexity and Model Checking
Sort
View
FOCS
2005
IEEE
14 years 2 months ago
Safraless Decision Procedures
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
Orna Kupferman, Moshe Y. Vardi
CONCUR
2003
Springer
14 years 1 months ago
Abstract Patterns of Compositional Reasoning
Patterns of Compositional Reasoning Nina Amla1 , E. Allen Emerson2 , Kedar Namjoshi3 , and Richard Trefler4 1 Cadence Design Systems 2 Univ. of Texas at Austin 3 Bell Labs, Lucent...
Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Ri...
ICSE
2001
IEEE-ACM
14 years 1 months ago
Fast Formal Analysis of Requirements via "Topoi Diagrams"
Early testing of requirements can decrease the cost of removing errors in software projects. However, unless done carefully, that testing process can significantly add to the cos...
Tim Menzies, John D. Powell, Michael E. Houle
MMMACNS
2001
Springer
14 years 1 months ago
Typed MSR: Syntax and Examples
Abstract. Many design flaws and incorrect analyses of cryptographic protoAppeared in the Proceedings of the First International Workshop on Mathematical Methods, Models and Archit...
Iliano Cervesato
SIGSOFT
2000
ACM
14 years 1 months ago
Automated systematic testing for constraint-based interactive services
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
Patrice Godefroid, Lalita Jategaonkar Jagadeesan, ...