899 search results - page 123 / 180 » A CTL-Based Logic for Program Abstractions |
164
click to vote
WWW
2006
ACM
16 years 3 days ago
2006
ACM
A Service oriented system emerges from composition of services. Dynamically composed reactive Web services form a special class of service oriented system, where the delays associ...
183
click to vote
SPIN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In the classic approach to logic model checking, software verification requires a manually constructed artifact (the model) to be written in the language that is accepted...
165
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
275
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
133
click to vote
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...