Sciweavers

6274 search results - page 287 / 1255
» Proofs, Programs, Processes
Sort
View
LISP
2002
81views more  LISP 2002»
15 years 6 months ago
Secure Information Flow via Linear Continuations
Security-typed languages enforce secrecy or integrity policies by type-checking. This paper investigates continuation-passing style (CPS) as a means of proving that such languages...
Steve Zdancewic, Andrew C. Myers
PPDP
2010
Springer
15 years 5 months ago
Permissive-nominal logic
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
Gilles Dowek, Murdoch James Gabbay
DALT
2009
Springer
16 years 1 months ago
Playing with Rules
Abstract. In this paper we revisit Logic Programming under the answer-set semantics - or Answer-Set Programming - and its extension Evolving Logic Programming, two languages that u...
João Leite
ICALP
2000
Springer
15 years 10 months ago
A Generic Model for Diagram Syntax and Semantics
In this paper, we recall how the syntax of diagrams is captured by the diagram editor generator DIAGEN, and outline a visual, rule-based, and objectoriented programming language b...
Berthold Hoffmann, Mark Minas
WCRE
1995
IEEE
15 years 10 months ago
Strongest Postcondition Semantics as the Formal Basis for Reverse Engineering
Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be...
Gerald C. Gannod, Betty H. C. Cheng