• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,626
Next 10 →

On the Verification by Approximation of Duration Systems

by Narjes Berregeb, Riadh Robbana , 2003
"... Abstract: We consider the problem of verifying invariance properties for duration systems. Such systems are (extended) timed graphs with duration variables. They are especially suitable for describing real time schedulers. However, for this kind of systems, the verification problem of invariance pro ..."
Abstract - Add to MetaCart
Abstract: We consider the problem of verifying invariance properties for duration systems. Such systems are (extended) timed graphs with duration variables. They are especially suitable for describing real time schedulers. However, for this kind of systems, the verification problem of invariance

Systematic design of program analysis frameworks

by Patrick Cousot, Radhia Cousot - In 6th POPL , 1979
"... Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant ..."
Abstract - Cited by 765 (50 self) - Add to MetaCart
Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant

The algorithmic analysis of hybrid systems

by R. Alur, C. Courcoubetis, N. Halbwachs , T. A. Henzinger, P.-H. Ho, X. Nicollin , A. Olivero , J. Sifakis , S. Yovine - THEORETICAL COMPUTER SCIENCE , 1995
"... We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamica ..."
Abstract - Cited by 778 (71 self) - Add to MetaCart
to dynamical laws. For verification purposes, we restrict ourselves to linear hybrid systems, where all variables follow piecewise-linear trajectories. We provide decidability and undecidability results for classes of linear hybrid systems, and we show that standard program-analysis techniques can be adapted

Bandera: Extracting Finite-state Models from Java Source Code

by James C. Corbett, Matthew B. Dwyer, John Hatcliff, Shawn Laubach, Corina S. Pasareanu, Hongjun Zheng - IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING , 2000
"... Finite-state verification techniques, such as model checking, have shown promise as a cost-effective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract - Cited by 654 (33 self) - Add to MetaCart
finite-state model that approximates the executable behavior of the software system of interest. Current best-practice involves handconstruction of models which is expensive (prohibitive for all but the smallest systems), prone to errors (which can result in misleading verification results

Automatic Symbolic Verification of Embedded Systems

by Rajeev Alur , Thomas A. Henzinger , Pei-hsin Ho , 1996
"... We present a model-checking procedure and its implementation for the automatic verification of embedded systems. The system components are described as Hybrid Automata -- communicating machines with finite control and real-valued variables that represent continuous environment parameters such as tim ..."
Abstract - Cited by 330 (24 self) - Add to MetaCart
We present a model-checking procedure and its implementation for the automatic verification of embedded systems. The system components are described as Hybrid Automata -- communicating machines with finite control and real-valued variables that represent continuous environment parameters

PRISM: A tool for automatic verification of probabilistic systems

by Andrew Hinton, Marta Kwiatkowska, Gethin Norman, David Parker - Proc. 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’06), volume 3920 of LNCS , 2006
"... Abstract. Probabilistic model checking is an automatic formal verification technique for analysing quantitative properties of systems which exhibit stochastic behaviour. PRISM is a probabilistic model checking tool which has already been successfully deployed in a wide range of application domains, ..."
Abstract - Cited by 282 (33 self) - Add to MetaCart
Abstract. Probabilistic model checking is an automatic formal verification technique for analysing quantitative properties of systems which exhibit stochastic behaviour. PRISM is a probabilistic model checking tool which has already been successfully deployed in a wide range of application domains

Learning assumptions for compositional verification

by Jamieson M. Cobleigh, Dimitra Giannakopoulou, Corina S. Păsăreanu , 2003
"... Compositional verification is a promising approach to addressing the state explosion problem associated with model checking. One compositional technique advocates proving properties of a system by checking properties of its components in an assume-guarantee style. However, the application of this t ..."
Abstract - Cited by 140 (20 self) - Add to MetaCart
Compositional verification is a promising approach to addressing the state explosion problem associated with model checking. One compositional technique advocates proving properties of a system by checking properties of its components in an assume-guarantee style. However, the application

Model-checking algorithms for continuous-time Markov chains

by Christel Baier, Boudewijn Haverkort, Holger Hermanns, Joost-Pieter Katoen - IEEE TRANSACTIONS ON SOFTWARE ENGINEERING , 2003
"... Continuous-time Markov chains (CTMCs) have been widely used to determine system performance and dependability characteristics. Their analysis most often concerns the computation of steady-state and transient-state probabilities. This paper introduces a branching temporal logic for expressing real-t ..."
Abstract - Cited by 235 (48 self) - Add to MetaCart
Continuous-time Markov chains (CTMCs) have been widely used to determine system performance and dependability characteristics. Their analysis most often concerns the computation of steady-state and transient-state probabilities. This paper introduces a branching temporal logic for expressing real

Verification of Linear Hybrid Systems By Means of Convex Approximations

by Nicolas Halbwachs, Pascal Raymond, Yann-eric Proy , 1994
"... We present a new application of the abstract interpretation by means of convex polyhedra, to a class of hybrid systems, i.e., systems involving both discrete and continuous variables. The result is an efficient automatic tool for approximate, but conservative, verification of reachability propert ..."
Abstract - Cited by 94 (2 self) - Add to MetaCart
We present a new application of the abstract interpretation by means of convex polyhedra, to a class of hybrid systems, i.e., systems involving both discrete and continuous variables. The result is an efficient automatic tool for approximate, but conservative, verification of reachability

Computational Techniques for Hybrid System Verification

by Alongkrit Chutinan, Bruce H. Krogh - IEEE Trans. on Automatic Control , 2003
"... Abstract—This paper concerns computational methods for ver-ifying properties of polyhedral invariant hybrid automata (PIHA), which are hybrid automata with discrete transitions governed by polyhedral guards. To verify properties of the state trajectories for PIHA, the planar switching surfaces are p ..."
Abstract - Cited by 115 (5 self) - Add to MetaCart
are partitioned to define a finite set of discrete states in an approximate quotient transition system (AQTS). State transitions in the AQTS are determined by the reachable states, or flow pipes, emitting from the switching sur-faces according to the continuous dynamics. This paper presents a method for computing
Next 10 →
Results 1 - 10 of 1,626
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University