Sciweavers

IANDC
2006
52views more  IANDC 2006»
13 years 5 months ago
Incompleteness of states w.r.t. traces in model checking
Cousot and Cousot introduced and studied a general past/future-time specification language, called
Roberto Giacobazzi, Francesco Ranzato
IANDC
2006
113views more  IANDC 2006»
13 years 5 months ago
Automata and fixed point logic: A coalgebraic perspective
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
Yde Venema
IANDC
2006
86views more  IANDC 2006»
13 years 5 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
IANDC
2006
77views more  IANDC 2006»
13 years 5 months ago
Weakly complete axiomatization of exogenous quantum propositional logic
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical rea...
Paulo Mateus, Amílcar Sernadas
IANDC
2006
63views more  IANDC 2006»
13 years 5 months ago
Distributive laws for the coinductive solution of recursive equations
This paper illustrates the relevance of distributive laws for the solution of recursive equations, and shows that one approach for obtaining coinductive solutions of equations via...
Bart Jacobs
IANDC
2006
103views more  IANDC 2006»
13 years 5 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...
IANDC
2006
83views more  IANDC 2006»
13 years 5 months ago
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
IANDC
2006
93views more  IANDC 2006»
13 years 5 months ago
Automation for interactive proof: First prototype
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...
Jia Meng, Claire Quigley, Lawrence C. Paulson
IANDC
2006
117views more  IANDC 2006»
13 years 5 months ago
A modular approach to defining and characterising notions of simulation
We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notio...
Corina Cîrstea
IANDC
2006
81views more  IANDC 2006»
13 years 5 months ago
True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
This paper is devoted to probabilistic models for concurrent systems under their true-concurrency semantics. Here we address probabilistic event structures. We consider a new clas...
Samy Abbes, Albert Benveniste