Sciweavers

313 search results - page 31 / 63
» Model equivalence of PRISM programs
Sort
View
MSCS
2010
84views more  MSCS 2010»
13 years 6 months ago
Channel abstractions for network security
Abstractions for Network Security† MICH E L E B U G L I E S I, R I C C A R D O F O C A R D I Dipartimento di Informatica, Universit`a Ca’ Foscari, Venice. Received 6 October 20...
Michele Bugliesi, Riccardo Focardi
CONCUR
2007
Springer
14 years 2 months ago
Coalgebraic Models for Reactive Systems
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
Filippo Bonchi, Ugo Montanari
LICS
1991
IEEE
13 years 11 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
PPSC
1997
13 years 9 months ago
High-Performance Object-Oriented Scientific Programming in Fortran 90
We illustrate how Fortran 90 supports object-oriented concepts by example of plasma particle computations on the IBM SP. Our experience shows that Fortran 90 and object-oriented m...
Charles D. Norton, Viktor K. Decyk, Boleslaw K. Sz...
ICFP
2007
ACM
14 years 7 months ago
Inductive reasoning about effectful data types
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
Andrzej Filinski, Kristian Støvring