Sciweavers

2905 search results - page 135 / 581
» Formal Memetic Algorithms
Sort
View
SAS
2007
Springer
14 years 4 months ago
Modular Safety Checking for Fine-Grained Concurrency
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacer...
Cristiano Calcagno, Matthew J. Parkinson, Viktor V...
SFM
2007
Springer
107views Formal Methods» more  SFM 2007»
14 years 4 months ago
A Survey of Markovian Behavioral Equivalences
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches ...
Marco Bernardo
SYNASC
2005
IEEE
77views Algorithms» more  SYNASC 2005»
14 years 3 months ago
On P Systems with Bounded Parallelism
— A framework that describes the evolution of P systems with bounded parallelism is defined by introducing basic formal features that can be then integrated into a structural op...
Francesco Bernardini, Francisco José Romero...
TLDI
2003
ACM
108views Formal Methods» more  TLDI 2003»
14 years 3 months ago
Inferring annotated types for inter-procedural register allocation with constructor flattening
We introduce an annotated type system for a compiler intermediate language. The type system is designed to support inter-procedural register allocation and the representation of t...
Torben Amtoft, Robert Muller
ECAL
2001
Springer
14 years 2 months ago
Taxonomy in Alife. Measures of Similarity for Complex Artificial Organisms
In this paper a formal approach to construction of a similarity measure for complex creatures is presented. The simulation model is described, and a Framsticks agent is expressed i...
Maciej Komosinski, Marek Kubiak