Sciweavers

584 search results - page 62 / 117
» Logic Programs as term Rewriting Systems
Sort
View
ICFP
2010
ACM
14 years 10 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...
ATAL
2010
Springer
14 years 11 months ago
Model checking detectability of attacks in multiagent systems
Information security is vital to many multiagent system applications. In this paper we formalise the notion of detectability of attacks in a MAS setting and analyse its applicabil...
Ioana Boureanu, Mika Cohen, Alessio Lomuscio
CASES
2010
ACM
14 years 7 months ago
Real-time unobtrusive program execution trace compression using branch predictor events
Unobtrusive capturing of program execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited program segments is often cost-prohibi...
Vladimir Uzelac, Aleksandar Milenkovic, Martin Bur...
FMCO
2007
Springer
169views Formal Methods» more  FMCO 2007»
15 years 4 months ago
An Object-Oriented Component Model for Heterogeneous Nets
Abstract. Many distributed applications can be understood in terms of components interacting in an open environment. This interaction is not always uniform as the network may consi...
Einar Broch Johnsen, Olaf Owe, Joakim Bjørk...
PADO
2001
Springer
15 years 2 months ago
Run-Time Bytecode Specialization
This paper describes a run-time specialization system for the Java language. One of the main difficulties of supporting the full Java language resides in a sound yet effective ma...
Hidehiko Masuhara, Akinori Yonezawa