Sciweavers

1716 search results - page 86 / 344
» Proving Conditional Termination
Sort
View
APLAS
2010
ACM
13 years 9 months ago
Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
Jan Hoffmann 0002, Martin Hofmann
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 9 months ago
Verification of Java Bytecode using Analysis and Transformation of Logic Programs
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...
Elvira Albert, Miguel Gómez-Zamalloa, Laure...
CSFW
2011
IEEE
12 years 8 months ago
Formal Analysis of Protocols Based on TPM State Registers
—We present a Horn-clause-based framework for analysing security protocols that use platform configuration registers (PCRs), which are registers for maintaining state inside the...
Stéphanie Delaune, Steve Kremer, Mark Dermo...
POPL
2012
ACM
12 years 4 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
IJFCS
2008
88views more  IJFCS 2008»
13 years 8 months ago
On a Characterization of Cellular Automata in Tilings of the Hyperbolic Plane
In this paper, we look at the extension of Hedlund's characterization of cellular automata to the case of cellular automata in the hyperbolic plane. This requires an addition...
Maurice Margenstern