1226 search results - page 120 / 246 » Proofs, Programs and Abstract Complexity |
129
Voted
ICECCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Collaborative development, incremental design and revision management require the ability to compare different versions of software artifacts. There are well-established approache...
136
Voted
FOSSACS
2007
Springer
15 years 9 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
115
click to vote
ISMVL
1999
IEEE
15 years 7 months ago
1999
IEEE
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
138
Voted
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
122
Voted
POPL
2010
ACM
16 years 26 days ago
2010
ACM
Program analysis tools typically compute two types of information: (1) may information that is true of all program executions and is used to prove the absence of bugs in the progr...