Sciweavers

1020 search results - page 181 / 204
» Tight Semantics for Logic Programs
Sort
View
JLP
2006
81views more  JLP 2006»
13 years 7 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
CASES
2005
ACM
13 years 9 months ago
An Esterel processor with full preemption support and its worst case reaction time analysis
The concurrent synchronous language Esterel allows proto treat reactive systems in an abstract, concise manner. An Esterel program is typically first translated into other, non-s...
Xin Li, Jan Lukoschus, Marian Boldt, Michael Harde...
SEMWEB
2004
Springer
14 years 28 days ago
Learning Meta-descriptions of the FOAF Network
We argue that in a distributed context, such as the Semantic Web, ontology engineers and data creators often cannot control (or even imagine) the possible uses their data or ontolo...
Gunnar Aastrand Grimnes, Peter Edwards, Alun D. Pr...
PLDI
2006
ACM
14 years 1 months ago
Precise alias analysis for static detection of web application vulnerabilities
The number and the importance of web applications have increased rapidly over the last years. At the same time, the quantity and impact of security vulnerabilities in such applica...
Nenad Jovanovic, Christopher Kruegel, Engin Kirda
HASKELL
2006
ACM
14 years 1 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser