Sciweavers

283 search results - page 23 / 57
» Extracting Program Logics From Abstract Interpretations Defi...
Sort
View
LPNMR
1990
Springer
13 years 11 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote

Book
290views
15 years 5 months ago
Type Theory and Functional Programming
"Constructive Type theory has been a topic of research interest to computer scientists, mathematicians, logicians and philosophers for a number of years. For computer scient...
Simon Thompson
CAEPIA
2009
Springer
13 years 8 months ago
Closeness and Distance Relations in Order of Magnitude Qualitative Reasoning via PDL
The syntax, semantics and an axiom system for an extension of Propositional Dynamic Logic (PDL) for order of magnitude qualitative reasoning which formalizes the concepts of close...
Alfredo Burrieza, Emilio Muñoz-Velasco, Man...
POPL
2004
ACM
14 years 8 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
CIE
2006
Springer
13 years 11 months ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky