Sciweavers

284 search results - page 38 / 57
» Modularity of Completeness Revisited
Sort
View
LOPSTR
2001
Springer
14 years 2 months ago
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Giorgio Delzanno, Sandro Etalle
MOBICOM
1997
ACM
14 years 2 months ago
A Protection Scheme for Mobile Agents on Java
: This paper describes a protection scheme for mobile agents implemented on a Java environment. In this scheme, access to objects is controlled by means of software capabilities th...
Daniel Hagimont, Leila Ismail
BIRTHDAY
2006
Springer
14 years 1 months ago
Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency
Abstract. A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsi...
Arnon Avron, Anna Zamansky
DSVIS
2008
Springer
13 years 11 months ago
Graphic Rendering Considered as a Compilation Chain
Graphical rendering must be fast enough so as to avoid hindering the user perception/action loop. Traditionally, programmers interleave descriptions and optimizations to achieve su...
Benjamin Tissoires, Stéphane Conversy
FM
2008
Springer
171views Formal Methods» more  FM 2008»
13 years 11 months ago
Assume-Guarantee Verification for Interface Automata
Interface automata provide a formalism capturing the high level interactions between software components. Checking compatibility, and other safety properties, in an automata-based ...
Michael Emmi, Dimitra Giannakopoulou, Corina S. Pa...