Sciweavers

509 search results - page 9 / 102
» On the completeness of compositional reasoning methods
Sort
View
AAAI
1990
13 years 8 months ago
Mechanizing Inductive Reasoning
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
Emmanuel Kounalis, Michaël Rusinowitch
ENTCS
2006
133views more  ENTCS 2006»
13 years 7 months ago
A Compositional Natural Semantics and Hoare Logic for Low-Level Languages
The advent of proof-carrying code has generated significant interest in reasoning about low-level languages. It is widely believed that low-level languages with jumps must be diff...
Ando Saabas, Tarmo Uustalu
GECCO
2011
Springer
256views Optimization» more  GECCO 2011»
12 years 11 months ago
Evolving complete robots with CPPN-NEAT: the utility of recurrent connections
This paper extends prior work using Compositional Pattern Producing Networks (CPPNs) as a generative encoding for the purpose of simultaneously evolving robot morphology and contr...
Joshua E. Auerbach, Josh C. Bongard
SOCO
2010
Springer
13 years 6 months ago
Evolving the memory of a criminal's face: methods to search a face space more effectively
Witnesses and victims of serious crime are often required to construct a facial composite, a visual likeness of a suspect’s face. The traditional method is for them to select in...
Charlie D. Frowd, Vicki Bruce, Melanie Pitchford, ...
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 7 months ago
Sound Bisimulations for Higher-Order Distributed Process Calculus
Abstract. While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we develop a bis...
Adrien Piérard, Eijiro Sumii