Results 1  10
of
12
Intrusion Detection via Static Analysis
, 2001
"... One of the primary challenges in intrusion detection is modelling typical application behavior, so that we can recognize attacks by their atypical effects without raising too many false alarms. We show how static analysis may be used to automatically derive a model of application behavior. The resul ..."
Abstract

Cited by 281 (1 self)
 Add to MetaCart
One of the primary challenges in intrusion detection is modelling typical application behavior, so that we can recognize attacks by their atypical effects without raising too many false alarms. We show how static analysis may be used to automatically derive a model of application behavior. The result is a hostbased intrusion detection system with three advantages: a high degree of automation, protection against a broad class of attacks based on corrupted code, and the elimination of false alarms. We report on our experience with a prototype implementation of this technique. 1. Introduction Computer security has undergone a major renaissance in the last five years. Beginning with Sun's introduction of the Java language and its support of mobile code in 1995, programming languages have been a major focus of security research. Many papers have been published applying programming language theory to protection problems [25, 24], especially information flow [17]. Security, however, is a ma...
Architectures for an Event Notification Service Scalable to Widearea Networks
, 1998
"... resi, Gino Biondini, Fabiano Cattaneo, Thorna Humphries, Artur Klauser, Pier Luca Lanzi, Edoardo Marcora, Mark Maybee, Mattia Monga, Alessandro Orso, Gian Pietro Picco, Matteo Pradella, Giuseppe Ricci, Massimo Ricotti, Sergio Silva, Judith Stafford, Laura Vidal, Giovanni Vigna, : : : and many others ..."
Abstract

Cited by 87 (4 self)
 Add to MetaCart
resi, Gino Biondini, Fabiano Cattaneo, Thorna Humphries, Artur Klauser, Pier Luca Lanzi, Edoardo Marcora, Mark Maybee, Mattia Monga, Alessandro Orso, Gian Pietro Picco, Matteo Pradella, Giuseppe Ricci, Massimo Ricotti, Sergio Silva, Judith Stafford, Laura Vidal, Giovanni Vigna, : : : and many others. Grazie di cuore a tutti. Milano, December 1998. Contents 1 Introduction 1 1.1 Focus and contribution of the thesis . . . . . . . . . . . . . . . . 2 1.2 Structure of the thesis . . . . . . . . . . . . . . . . . . . . . . . . . 4 2 Background and New Challenges 5 2.1 Related technology . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.1.1 Centralized event/message based environments . . . . . 7 2.1.2 Internet technology . . . . . . . . . . . . . . . . . . . . . . 10 2.1.3 Distributed eventbased infrastructures . . . . . . . . . . 12 2.2 New challenges for Eventbased technologies . . . . . . . . . . . 15 2.2.1 Discu
Verification on Infinite Structures
, 2000
"... In this chapter, we present a hierarchy of infinitestate systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonlystudied classes of systems such as contextfree and pushdown automata, and Petri net processes. We then examine the ..."
Abstract

Cited by 68 (2 self)
 Add to MetaCart
In this chapter, we present a hierarchy of infinitestate systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonlystudied classes of systems such as contextfree and pushdown automata, and Petri net processes. We then examine the equivalence and regularity checking problems for these classes, with special emphasis on bisimulation equivalence, stressing the structural techniques which have been devised for solving these problems. Finally, we explore the model checking problem over these classes with respect to various linear and branchingtime temporal logics.
An automatatheoretic approach to reasoning about infinitestate systems
 LNCS
, 2000
"... Abstract. We develop an automatatheoretic framework for reasoning about infinitestate sequential systems. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions betw ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
Abstract. We develop an automatatheoretic framework for reasoning about infinitestate sequential systems. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finitestate automata. Checking that the system satisfies a temporal property can then be done by an alternating twoway tree automaton that navigates through the tree. As has been the case with finitestate systems, the automatatheoretic framework is quite versatile. We demonstrate it by solving several versions of the modelchecking problem for §calculus specifications and prefixrecognizable systems, and by solving the realizability and synthesis problems for §calculus specifications with respect to prefixrecognizable environments. 1
ModelChecking Of Infinite Graphs Defined By Graph Grammars
 In Proc. 1st International workshop on verification of infinite states systems, volume 6 of ENTCS
, 1996
"... : We propose here an algorithm that decides whether a state of an infinite graph defined by a graph grammar satisfies a given formula of the alternationfree calculus. We first show how graph grammars enable to finitely represent infinite transition systems. In particular, a connection is made betw ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
: We propose here an algorithm that decides whether a state of an infinite graph defined by a graph grammar satisfies a given formula of the alternationfree calculus. We first show how graph grammars enable to finitely represent infinite transition systems. In particular, a connection is made between a state of the graph grammar and the states of the infinite graph it represents. We then present succinctly the syntax and the standard semantics of the calculus. A nonstandard semantics, called assertionbased semantics is then proposed. That semantics makes possible to reduce the study of the semantics of an infinite graph to parts of that graph by using correct assertions. Our algorithm then determines transformers, for each state of the graph grammar, which, given the context, expressed by an assertion, of a state of the graph represented by a state of the graph grammar, decides whether a given formula is satisfied by that state of the graph, or not. Keywords: Infinitestate sys...
Global modelchecking of infinitestate systems
 in: Proc. 16th International Conference on Computer Aided Verification, CAV’04, in: LNCS
, 2004
"... Abstract. We extend the automatatheoretic framework for reasoning about infinitestate sequential systems to handle also the global modelchecking problem. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed a ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. We extend the automatatheoretic framework for reasoning about infinitestate sequential systems to handle also the global modelchecking problem. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finitestate automata. Checking that the system satisfies a temporal property can then be done by a twoway automaton that navigates through the tree. The framework is known for local model checking. For branching time properties, the framework uses twoway alternating automata. For linear time properties, the framework uses twoway path automata. In order to solve the global modelchecking problem we show that for both types of automata, given a regular tree, we can construct a nondeterministic word automaton that accepts all the nodes in the tree from which an accepting run of the automaton can start. 1
Puzzles for Learning Model Checking, Model Checking for Programming Puzzles, Puzzles for Testing Model Checkers
 Computer Laboratory, University of Kent at
, 2000
"... Paper discuss some issues related to model checking: (1) early model checking teaching via games, (2) utility of model checking and games for solving puzzles, (3) importance of games for validation of model checkers. Basic ideas are illustrated by a model checking based solution for a complicate ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Paper discuss some issues related to model checking: (1) early model checking teaching via games, (2) utility of model checking and games for solving puzzles, (3) importance of games for validation of model checkers. Basic ideas are illustrated by a model checking based solution for a complicated puzzle how to identify a unique false coin among given ones balancing them limited times. 1
Micromacro stack systems: A new frontier of decidability for sequential systems
 In 18th LICS, 381390
, 2003
"... We define the class of micromacro stack graphs, a new class of graphs modeling infinitestate sequential systems with a decidable modelchecking problem. Micromacro stack graphs are the configuration graphs of stack automata whose states are partitioned into micro and macro states. Nodes of the gr ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We define the class of micromacro stack graphs, a new class of graphs modeling infinitestate sequential systems with a decidable modelchecking problem. Micromacro stack graphs are the configuration graphs of stack automata whose states are partitioned into micro and macro states. Nodes of the graph are configurations of the stack automaton where the state is a macro state. Edges of the graph correspond to the sequence of micro steps that the automaton makes between macro states. We prove that this class strictly contains the class of prefixrecognizable graphs. We give a direct automatatheoretic algorithm for model checking ¢calculus formulas over micromacro stack graphs. 1
Formal Verification of Processes
, 2001
"... We consider the problem of formally verifying of processes given in a process algebra with respect to specifications in the modal calculus. For this problem, we present a Gentzenstyle sequent calculus which can be used for different process algebras, and which allows compositional reasoning. The k ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider the problem of formally verifying of processes given in a process algebra with respect to specifications in the modal calculus. For this problem, we present a Gentzenstyle sequent calculus which can be used for different process algebras, and which allows compositional reasoning. The key property of this calculus, due to Dam and Gurov, is the use of explicit ordinal approximations in order to deal with properties expressed by fixedpoint operators.
Truth  A Platform for Verification of Distributed Systems
, 1998
"... Formal Methods are becoming more an more important for the development of hardware and software systems. Verification tools support the employment of Formal Methods. This paper gives an overview of the design and implementation of the verification tool Truth. We define and explain requirements for v ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Formal Methods are becoming more an more important for the development of hardware and software systems. Verification tools support the employment of Formal Methods. This paper gives an overview of the design and implementation of the verification tool Truth. We define and explain requirements for verification tools. Furthermore, we discuss several semantic models, specification languages and logics and their visualisation from a tool builder's perspective and show how these requirements were adopted in Truth. Contents 1 Introduction 2 2 Fundamental Concepts of the Verification of Finite State Systems 3 3 An Overview of the Implementation of Truth 6 3.1 The design of Truth . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.2 Implementation issues . . . . . . . . . . . . . . . . . . . . . . . . 8 3.2.1 Type system . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.2.2 Algebraic data types and pattern matching . . . . . . . . . 9 3.2.3 Monadic IO . . . . . . . . . . . . . . ....