2086 search results - page 129 / 418 » Mathematical Theory Exploration |
231
Voted
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
132
click to vote
PODS
2006
ACM
16 years 3 months ago
2006
ACM
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
137
Voted
ACL2
2006
ACM
15 years 9 months ago
2006
ACM
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
143
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
112
Voted
AO
2007
15 years 3 months ago
2007
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...