Sciweavers

2623 search results - page 186 / 525
» Hoare Logic in the Abstract
Sort
View
POPL
2000
ACM
15 years 2 months ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini
73
Voted
COMMA
2006
14 years 11 months ago
Semi-Stable Semantics
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...
Martin Caminada
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
14 years 5 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...
103
Voted
DASC
2006
IEEE
15 years 4 months ago
Analysing Stream Authentication Protocols in Autonomous Agent-Based Systems
Abstract— In stream authentication protocols used for largescale data dissemination in autonomuous systems, authentication is based on the timing of the publication of keys, and ...
Mehmet A. Orgun, Ji Ma, Chuchang Liu, Guido Govern...
80
Voted
AI
2002
Springer
14 years 10 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni