Sciweavers

4257 search results - page 16 / 852
» The Logical Modularity of Programs
Sort
View
ENTCS
2008
124views more  ENTCS 2008»
15 years 1 months ago
Modular Games for Coalgebraic Fixed Point Logics
We build on existing work on finitary modular coalgebraic logics [3,4], which we extend with general fixed points, including CTL- and PDL-like fixed points, and modular evaluation...
Corina Cîrstea, Mehrnoosh Sadrzadeh
PLDI
2011
ACM
14 years 4 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
SAS
2004
Springer
134views Formal Methods» more  SAS 2004»
15 years 7 months ago
Towards Declarative Programming for Web Services
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....
Sheila A. McIlraith
ECOOP
2006
Springer
15 years 5 months ago
Responders: Language Support for Interactive Applications
A variety of application domains are interactive in nature: a primary task involves responding to external actions. In this paper, we introduce explicit programming language suppor...
Brian Chin, Todd D. Millstein
BIRTHDAY
2006
Springer
15 years 5 months ago
Computational Logic in an Object-Oriented World
Logic and object-orientation (OO) are competing ways of looking at the world. Both view the world in terms of individuals. But logic focuses on the relationships between individual...
Bob Kowalski