3136 search results - page 302 / 628 » Genetic programming theory |
146
click to vote
AMAST
2006
Springer
15 years 10 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
167
click to vote
MPC
1995
Springer
15 years 9 months ago
1995
Springer
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
152
Voted
FORTE
2008
15 years 7 months ago
2008
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
157
click to vote
HASKELL
2008
ACM
15 years 7 months ago
2008
ACM
Eight years ago, functional dependencies, a concept from the theory of relational databases, were proposed as a mechanism for avoiding common problems with multiple parameter type...
146
click to vote
AO
2007
15 years 6 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...