• Conference Object  

      An abstract channel specification and an algorithm implementing it using Java sockets 

      Georgiou, Chryssis; Shvartsman, A. A.; Musiał, Peter M.; Sonderegger, E. L. (2008)
      Models and specifications can be used in the design of distributed applications to formally reason about their safety properties. However, the benefits of using formal methods are often negated by the ad hoc process of ...
    • Article  

      An argumentation framework for reasoning about actions and change 

      Kakas, Antonis C.; Miller, R.; Toni, F. (1999)
      We show how a class of domains written in the Language E, a high level language for reasoning about actions, narratives and change, can be translated into the argumentation framework of Logic Programming without Negation ...
    • Article  

      Automated implementation of complex distributed algorithms specified in the IOA language 

      Georgiou, Chryssis; Lynch, N.; Mavrommatis, Panayiotis; Tauber, J. A. (2009)
      IOA is a formal language for describing Input/Output automata that serves both as a formal specification language and as a programming language (Garland et al. in http://theory.lcs.mit.edu/tds/ioa/manual.ps, 2004). The IOA ...
    • Article  

      Exploiting course grain parallelism from FORTRAN by mapping it to IF1 

      Lachanas, Adrianos; Evripidou, Paraskevas (1998)
      FORTRAN, a classical imperative language is mapped into IF1, a machine-independent dataflow graph description language with Single Assingment Semantics (SAS). Parafrase 2 (P2) is used as the front-end of our system. It ...
    • Article  

      Maximum likelihood failure diagnosis in finite state machines under unreliable observations 

      Athanasopoulou, E.; Li, L.; Hadjicostis, Christoforos N. (2010)
      In this paper, we develop a probabilistic methodology for failure diagnosis in finite state machines based on a sequence of unreliable observations. Given prior knowledge of the input probability distribution but without ...
    • Article  

      Propagation in CSP and SAT 

      Dimopoulos, Yannis; Stergiou, K. (2006)
      Constraint Satisfaction Problems and Prepositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importance in both frameworks is that of constraint propagation. ...