Sciweavers

1342 search results - page 110 / 269
» Ordered Programs as Abductive Systems
Sort
View
POPL
2008
ACM
16 years 6 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
EUROGP
2007
Springer
104views Optimization» more  EUROGP 2007»
16 years 16 days ago
Code Regulation in Open Ended Evolution
We explore a homeostatic approach to program execution in computer systems: the “concentration” of computation services is regulated according to their fitness. The goal is to...
Lidia Yamamoto
LCTRTS
1998
Springer
15 years 10 months ago
Integrating Path and Timing Analysis Using Instruction-Level Simulation Techniques
Abstract. Previously published methods for estimation of the worstcase execution time on contemporary processors with complex pipelines and multi-level memory hierarchies result in...
Thomas Lundqvist, Per Stenström
IPSN
2009
Springer
16 years 1 months ago
Automating rendezvous and proxy selection in sensornets
As the diversity of sensornet use cases increases, the combinations of environments and applications that will coexist will make custom engineering increasingly impractical. We in...
David Chu, Joseph M. Hellerstein
KBSE
1994
IEEE
15 years 10 months ago
A Formal Approach to Domain-Oriented Software Design Environments
This paper describes a formal approach to domain-oriented software design environments, based on declarative domain theories, formal specifications, and deductive program synthesi...
Michael R. Lowry, Andrew Philpot, Thomas Pressburg...