Sciweavers

174 search results - page 14 / 35
» Existential Fixed-Point Logic
Sort
View
CADE
2007
Springer
16 years 4 months ago
Inferring Invariants by Symbolic Execution
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
Benjamin Weiß, Peter H. Schmitt
EUROGP
2008
Springer
128views Optimization» more  EUROGP 2008»
15 years 5 months ago
Hardware Accelerators for Cartesian Genetic Programming
A new class of FPGA-based accelerators is presented for Cartesian Genetic Programming (CGP). The accelerators contain a genetic engine which is reused in all applications. Candidat...
Zdenek Vasícek, Lukás Sekanina
SCL
2010
114views more  SCL 2010»
14 years 11 months ago
Input-state incidence matrix of Boolean control networks and its applications
The input-state incidence matrix of control Boolean network is proposed. It is shown that this matrix contains complete information of the input-state mapping. Using it, an easily...
Yin Zhao, Hongsheng Qi, Daizhan Cheng
129
Voted
LICS
2010
IEEE
15 years 2 months ago
An Intuitionistic Logic that Proves Markov's Principle
—We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov’s principle suited for predicate lo...
Hugo Herbelin
TIME
2003
IEEE
15 years 9 months ago
Hybrid Logics on Linear Structures: Expressivity and Complexity
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
Massimo Franceschet, Maarten de Rijke, Bernd-Holge...