Sciweavers

4257 search results - page 291 / 852
» The Logical Modularity of Programs
Sort
View
ICFP
2005
ACM
16 years 6 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska
CADE
2007
Springer
16 years 6 months ago
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
Andrei Voronkov, Juan Antonio Navarro Pérez
CPE
2003
Springer
149views Hardware» more  CPE 2003»
15 years 11 months ago
Logical and Stochastic Modeling with SMART
We describe the main features of SmArT, a software package providing a seamless environment for the logic and probabilistic analysis of complex systems. SmArT can combine differen...
Gianfranco Ciardo, R. L. Jones III, Andrew S. Mine...
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
16 years 3 days ago
Investigating the performance of module acquisition in cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this pap...
James Alfred Walker, Julian Francis Miller
AMAST
1998
Springer
15 years 10 months ago
An Algebraic View of Program Composition
Abstract. We propose a general categorical setting for modeling program composition in which the call-by-value and call-by-name disciplines fit as special cases. Other notions of c...
Pietro Cenciarelli