Sciweavers

8109 search results - page 378 / 1622
» A Model of Component-Based Programming
Sort
View
EUROCOLT
1999
Springer
15 years 11 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
PLDI
1997
ACM
15 years 11 months ago
Incremental Analysis of real Programming Languages
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
Tim A. Wagner, Susan L. Graham
CASES
2005
ACM
15 years 8 months ago
Optimizing stream programs using linear state space analysis
Digital Signal Processing (DSP) is becoming increasingly widespread in portable devices. Due to harsh constraints on power, latency, and throughput in embedded environments, devel...
Sitij Agrawal, William Thies, Saman P. Amarasinghe
CORR
2011
Springer
176views Education» more  CORR 2011»
15 years 1 months ago
Quantitative Synthesis for Concurrent Programs
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...
NMR
2004
Springer
16 years 5 days ago
Preferential defeasibility: utility in defeasible logic programming
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...
Fernando A. Tohmé, Guillermo Ricardo Simari