Sciweavers

2625 search results - page 366 / 525
» The development of the Emerald programming language
Sort
View
ICML
2004
IEEE
16 years 7 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...
CSL
2009
Springer
16 years 1 months ago
Focalisation and Classical Realisability
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
Guillaume Munch-Maccagnoni
ER
2009
Springer
166views Database» more  ER 2009»
16 years 1 months ago
A Modeling Ontology for Integrating Vulnerabilities into Security Requirements Conceptual Foundations
Abstract. Vulnerabilities are weaknesses in the requirements, design, and implementation, which attackers exploit to compromise the system. This paper proposes a vulnerability-cent...
Golnaz Elahi, Eric S. K. Yu, Nicola Zannone
IFIP
2009
Springer
16 years 1 months ago
Static Detection of Logic Flaws in Service-Oriented Applications
Application or business logic, used in the development of services, has to do with the operations that define the application functionalities and not with the platform ones. Often...
Chiara Bodei, Linda Brodo, Roberto Bruni
TPHOL
2007
IEEE
16 years 22 days ago
Simple Types in Type Theory: Deep and Shallow Encodings
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
François Garillot, Benjamin Werner