Sciweavers

IANDC
2006
95views more  IANDC 2006»
13 years 11 months ago
The alternation hierarchy in fixpoint logic with chop is strict too
Fixpoint Logic with Chop extends the modal
Martin Lange
IANDC
2006
117views more  IANDC 2006»
13 years 11 months ago
Statistical probabilistic model checking with a focus on time-bounded properties
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on ...
Håkan L. S. Younes, Reid G. Simmons
IANDC
2006
78views more  IANDC 2006»
13 years 11 months ago
A stable programming language
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
Luca Paolini
IANDC
2006
79views more  IANDC 2006»
13 years 11 months ago
Efficient theory combination via boolean search
Many approaches to deciding the satisfiability of quantifier free formulae with respect to a background theory T -- also known as Satisfiability Modulo Theory, or SMT
Marco Bozzano, Roberto Bruttomesso, Alessandro Cim...
IANDC
2006
69views more  IANDC 2006»
13 years 11 months ago
Logics of communication and change
Johan van Benthem, Jan van Eijck, Barteld P. Kooi
IANDC
2006
77views more  IANDC 2006»
13 years 11 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
IANDC
2006
97views more  IANDC 2006»
13 years 11 months ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner