Gowritharan Maheswara, Jeremy S. Bradbury, Christopher Collins · 2012
� Tes$ng concurrent programs has become a major challenge due to the many different ways threads can interleave. � One solu$on is to use tools, such as NASA's Java PathFinder (JPF), to explore the thread interleaving space. � This tool’s limita$on is that the data is generally in the form of bulk text logs, which provide liJle support for common analysis tasks, such as finding common and rare error states. Research Goal: To provide a solu#on to the analy#c limita#ons of JPF by developing an interac#ve visualiza#on tool, TIE, which integrates with JPF to enhance concurrency debugging.
Cited by 0
Edmund M. Clarke · 1999
“When the time is ripe for certain things, these things appear in different places in the manner of violets coming to light in early spring. ” (Wolfgang Bolyai to his son Johann in urging him to claim the invention of non-Euclidean geometry without delay [Vit88]) 1 Model Checking Model Checking did not arise in a historical vacuum. There was an important problem that needed to be solved, namely Concurrent Program Verification. Concurrency errors are particularly difficult to find by program testing, since they are often hard to reproduce. Most of the formal research on this topic in-volved constructing proofs by hand using a Floyd-Hoare style logic. Probably, the best known formal system was the one proposed by Owicki and Gries [OG76] for reasoning about Conditional Critical Regions. Although I had written my thesis on the meta-theory of Hoare Logic [Cla77a,Cla77b,Cla78,Cla79a,Cla79c,Cla80] and was very familiar with the Owick-Gries proof methodology, I was quite skeptical about the scalability of hand constructed proofs. There had been some practical research on state exploration methods for communication protocols by Gregor Bochmann and others, but it was largely ignored by the “Formal Veri-fication Community”. Also, in the late 1970’s, Pnueli [Pnu77] and Owicki and Lamport [OL82] had proposed the use of Temporal Logic for specifying con-current programs. Although they still advocated hand constructed proofs, their work demonstrated convincingly that Temporal Logic was ideal for expressing concepts like mutual exclusion, absence of deadlock, and absence of starvation. Allen Emerson and I combined the state-exploration approach with Temporal Logic in an efficient manner and showed that the result could be used to solve non-trivial problems. Here is a quote from our original 1981 paper [CE81]:
Cited by 0
Muhammad Atif, Jan Friso Groote · Studies in systems, decision and control · 2023
Cited by 0
The MIT Press eBooks · 1997
Cited by 0
Moonzoo Kim · 2002
“Software bugs, or errors, are so prevalent and so detrimental that they cost the U.S. economy an estimated $59.5 billion annually, or about 0.6 percent of the gross domestic product At the national level, over half of the costs are borne by software users and the remainder by software developers/vendors.” The study also found that, although all errors cannot be removed, more than a third of these costs, or an estimated $22.2 billion, could be eliminated by an improved testing infrastructure that enables earlier and more effective identification and removal of software defects.”
Cited by 0
Nick Moffat, Michael Goldsmith, Hal Id Inria et al. · 2006
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Cited by 0
Peled D., Pelliccione P., SPOLETINI, PAOLA · IrInSubria (University of Insubria) · 2009
Cited by 0
Madhavan Mukund · Resonance · 2009
Cited by 2
2002
Cited by 0
Richard E. Chandler · Wiley StatsRef: Statistics Reference Online · 2014
Abstract Most statistical analyses are, implicitly or explicitly, based upon an underlying model for the data at hand. The conclusions from any analysis can therefore be justified only if the model is adequate. This article gives an overview of general principles for checking the adequacy of a statistical model. The focus is primarily upon models for relationships between variables. Specific techniques are summarized; for the reader who requires more detail, pointers to the relevant literature are given.
Cited by 0
T. Matoušek · 2008
Abstract. The paper summarizes the current state of our work addressing the verification of Windows kernel drivers via model checking technique. Our goal is to implement a tool that extracts verification models using driver source code and specifications of the kernel environment written in DeSpec language, which we introduced previously. The DeSpec language enables specifying the kernel environment as well as the rules imposed on drivers. The DeSpec Model Extractor tool builds a Zing model capturing those parts of the driver and kernel behavior related to a selected subset of the specification rules. Processing the resulting model in the Zing model checker could reveal the errors in the driver that are commonly difficult to discover via traditional methods of software testing due to the concurrency and complexity of the Windows kernel.
Cited by 0
Laís Picinini Freitas (7409444), Alexandra M. Schmidt (8691942), William Cossich (10994521) et al. · Figshare · 2021
Cited by 0Open access
Gerard O’Regan · Undergraduate topics in computer science · 2020
Cited by 0
Patrice Godefroid, Model Checking (mc Is · 2008
Cited by 0
Doron Peled · 2001
Abstract. Model checking is an effective way of comparing a system description against its formal specification and search systematically for errors. The method is gaining a lot of success by being integrated in the hardware design process, and in development of complicated protocols and software. Being an intractable problem, model checking is the ground for very active research that is inspired by many different areas in computer science. 1
Cited by 0
Dill, David L. · NASA Technical Reports Server (NASA)
Automatic formal verification methods for finite-state systems, also known as model-checking, successfully reduce labor costs since they are mostly automatic. Model checkers explicitly or implicitly enumerate the reachable state space of a system, whose behavior is described implicitly, perhaps by a program or a collection of finite automata. Simple properties, such as mutual exclusion or absence of deadlock, can be checked by inspecting individual states. More complex properties, such as lack of starvation, require search for cycles in the state graph with particular properties. Specifications to be checked may consist of built-in properties, such as deadlock or 'unspecified receptions' of messages, another program or implicit description, to be compared with a simulation, bisimulation, or language inclusion relation, or an assertion in one of several temporal logics. Finite-state verification tools are beginning to have a significant impact in commercial designs. There are many success stories of verification tools finding bugs in protocols or hardware controllers. In some cases, these tools have been incorporated into design methodology. Research in finite-state verification has been advancing rapidly, and is showing no signs of slowing down. Recent results include probabilistic algorithms for verification, exploitation of symmetry and independent events, and the use symbolic representations for Boolean functions and systems of linear inequalities. One of the most exciting areas for further research is the combination of model-checking with theorem-proving methods.
Cited by 0Open access
Zavattaro, Gianluigi · AMS Campus - AlmaDL · 2013
Cited by 0
Edmund M. Clarke · Lecture notes in computer science · 1997
Cited by 210
Béatrice Bérard, Michel Bidoit, Alain Finkel et al. · 2001
Cited by 3
Bolpagni M., Mastrolembo Ventura S · Institutional Research Information System (Università degli Studi di Brescia) · 2016
Cited by 0