Computer and information sciences topic list of research papers
-
A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus
Abstract This work presents a Propositional Dynamic Logic (πDL) in which the programs are described in a language based on the π-Calculus without replication. Our goal is to build a dynamic logic that is suitable for the description and verification ...
2010 / Mario R.F. Benevides, L. Menasché Schechter -
A Logic for Virtual Memory
Abstract We present an extension to classical separation logic which allows reasoning about virtual memory. Our logic is formalised in the Isabelle/HOL theorem prover in a manner allowing classical separation logic notation to be used at an abstract ...
2008 / Rafal Kolanski -
Symbolic and Abstract Interpretation for C/C++ Programs
Abstract We present a construction technique for abstract interpretations which is generic in the choice of data abstractions. The technique is specialised on C/C++ code, internally represented by the GIMPLE control flow graph as generated by the...
2008 / Helge Löding, Jan Peleska -
Formal Specification of a Web Services Protocol
Abstract We describe a use of formal methods to specify and check a Web Services protocol. The Web Services Atomic Transaction protocol was specified in TLA+ and checked with the TLC model checker. A modest effort revealed oversights that caused...
2004 / James E. Johnson, David E. Langworthy, Leslie Lamport, Friedrich H. Vogt -
A Hybridization of Irreflexive Modal Logics
Abstract This paper discusses a bimodal hybrid language with a sub-modality (called the irreflexive modality) associated with the intersection of the accessibility relation R and the inequality ≠. First, we provide the Hilbert-style axiomatizations...
2007 / Sano Katsuhiko -
Opportunities and Challenges in Process-algebraic Verification of Asynchronous Circuit Designs
Abstract This paper reports our experiences of applying process algebras and associated tools (esp. CSP/FDR2) to verify asynchronous circuit designs developed in the Balsa environment. Balsa is an asynchronous logic synthesis system which uses...
2006 / X. Wang, M. Kwiatkowska, G. Theodoropoulos, Q. Zhang -
Preface2009 / Juliana Küster Filipe Bowles, Iman Poernomo, Ralf Reussner
-
Tool Support for Holistic Modelling of Distributed Embedded Systems in Creol
Abstract A holistic approach to modelling embedded systems is advocated: Many aspects of a system should be analysed in isolation to keep the task manageable, but they often influence each other during integration in a way that the desired system...
2009 / Marcel Kyas -
Managing Conflicts of Interest in Virtual Organisations
Abstract In this paper, we present a formal model of virtual organisations that incorporates the concept of conflicts of interest. The model, which follows an incremental development approach using Event-B, focuses on goals and organisations at the...
2008 / Alvaro Arenas, Benjamin Aziz, Juan Bicarregui, Brian Matthews -
A natural language programming solution for executable papers
Abstract The paper describes a system for executable papers for publishers enabling them to reuse content and to generate further advances of science and engineering. The executable algorithmic descriptions within a paper are presented in natural...
2011 / Sandor M Veres, J. Patrik Adolfsson -
A comparative study of common and self-adaptive differential evolution strategies on numerical benchmark problems
Abstract Differential Evolution (DE) is a population-based stochastic global optimization technique that requires the adjustment of a very few parameters in order to produce results. However, the control parameters involved in DE are highly...
2011 / S.K. Goudos, K.B. Baltzis, K. Antoniadis, Z.D. Zaharis, C.S. Hilas -
Reliability of personal identification base on optical 3D measurement of a few facial landmarks
Abstract Technologies related to identity recognition have found widespread application in the last years; among these, face recognition is one of the most promising and probably the most studied. The main goal of this work is to verify if it is...
2010 / Emanuele Zappa, Paolo Mazzoleni -
An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
Abstract The theory of distributed computing shares a deep and fascinating connection with combinatorial and algebraic topology. One of the key ideas that facilitates the development of the topological theory of distributed computing is the use of...
2012 / Rodolfo Conde, Sergio Rajsbaum -
Variant Narrowing and Equational Unification
Abstract Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed as a union E = Δ ⊎ B ...
2009 / Santiago Escobar, José Meseguer, Ralf Sasse -
SmPL: A Domain-Specific Language for Specifying Collateral Evolutions in Linux Device Drivers
Abstract Collateral evolutions are a pervasive problem in large-scale software development. Such evolutions occur when an evolution that affects the interface of a generic library entails modifications, i.e., collateral evolutions, in all library...
2006 / Yoann Padioleau, Julia L. Lawall, Gilles Muller -
Time Aware System Refinement
Abstract We propose a formal, time aware refinement of systems. The proposed timewise refinement method is a direct extension of the traditional refinement calculus of Action Systems. The adaptation provides a well-founded mathematical basis for the ...
2007 / Tomi Westerlund, Juha Plosila -
The S3MS.NET Run Time Monitor
Abstract This paper describes the S3MS.NET run time monitor, a tool that can enforce security policies expressed in a variety of policy languages for .NET desktop or mobile applications. The tool consists of two major parts: a bytecode inliner that...
2009 / Lieven Desmet, Wouter Joosen, Fabio Massacci, Katsiaryna Naliuka, Pieter Philippaerts, et al. -
Bounded Model Checking for Deontic Interpreted Systems
Abstract We propose a framework for the verification of multi-agent systems' specification by symbolic model checking. The language CTLKD (an extension of CTL) allows for the representation of the temporal evolution of epistemic states of the...
2005 / Bożena Woźna, Alessio Lomuscio, Wojciech Penczek -
Leader Election in Rings of Ambient Processes
Abstract Palamidessi has shown that the π-calculus with mixed choice is powerful enough to solve the leader election problem on a symmetric ring of processes. We show that this is also possible in the calculus of Mobile Ambients (MA), without using...
2005 / Iain Phillips, Maria Grazia Vigliotti -
Algorithmic Verification of Noninterference Properties
Abstract The paper discusses the problem of model checking a number of noninterference properties in finite state systems: Noninterference, Nondeducibility on Inputs, Generalised Noninterference, Forward Correctability and Restrictiveness. The...
2007 / Ron van der Meyden, Chenyi Zhang