444 search results - page 86 / 89 » Automated Logical Verification Based on Trace Abstractions |
157
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
159
click to vote
CADE
2002
Springer
16 years 4 months ago
2002
Springer
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
135
click to vote
SEFM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract. We introduce a visual notation for local specification of concurrent components based on message sequence charts (MSCs). Each component is a finite-state machine whose ...
138
click to vote
RR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The Semantic Web is commonly perceived as a web of partially interlinked machine readable data. This data is inherently distributed and resembles the structure of the web...
135
click to vote
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...