233 search results - page 27 / 47 » Specifying, Programming and Verifying with Equational Logic |
ATAL
2006
Springer
15 years 2 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
GPCE
2009
Springer
15 years 3 months ago
2009
Springer
This paper describes a language and framework that allow coordinated transformations driven by invariants to be specified declaratively, as invariant rules, and applied automatic...
SIGSOFT
2005
ACM
15 years 12 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...
ISSTA
2004
ACM
15 years 4 months ago
2004
ACM
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
103
click to vote
PLDI
2004
ACM
15 years 4 months ago
2004
ACM
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...