899 search results - page 72 / 180 » A CTL-Based Logic for Program Abstractions |
110
click to vote
AUSAI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
118
click to vote
FOSSACS
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
102
Voted
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
91
Voted
CAISE
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper uses a framework drawn from work in the philosophy of science to characterize the concepts of program correctness that have been used in software engineering, ...
101
click to vote
CADE
2008
Springer
16 years 28 days ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...