the paper describes the results of applying Latent Semantic analysis (LSA), an advanced information retrieval method, to program source code and associated documentation. Latent Semantic analysis is a corpus-based sta...
详细信息
ISBN:
(纸本)0769509096;076950910X
the paper describes the results of applying Latent Semantic analysis (LSA), an advanced information retrieval method, to program source code and associated documentation. Latent Semantic analysis is a corpus-based statistical method for inducing and representing aspects of the meanings of words and passages (of natural language) reflective in their usage. this methodology is assessed for application to the domain of software components (i.e., source code and its accompanying documentation). Here LSA is used as the basis to cluster software components. this clustering is used to assist in the understanding of a nontrivial software system, namely a version of Mosaic. Applying Latent Semantic analysis to the domain of source code and internal documentation for the support of program understanding is a new application of this method and a departure from the normal application domain of natural language.
CASL, the common algebraic specification language, has been developed as a language that subsumes many previous algebraic specification frameworks and also provides tool interoperability. CASL is a complex language wi...
详细信息
ISBN:
(纸本)3540672826
CASL, the common algebraic specification language, has been developed as a language that subsumes many previous algebraic specification frameworks and also provides tool interoperability. CASL is a complex language with a complete formal semantics. It is therefore a challenge to build good tools for CASL. In this work, we present and discuss the Bremen HOL-CASL system, which provides,parsing, static checking, conversion to LATEX and theorem proving for: CASL specifications. To make tool construction manageable, we have followed some guidelines: re-use of existing tools, interoperability of tools developed at different sites, and construction of generic toolsthat can be used for several languages. We describe the structure of and the experiences with our tool and discuss how the guidelines work in practice.
Boolean Equation systems (BESs) provide a useful framework for the verification of concurrent finite-state systems. In practice, it is desirable that a BES resolution also yields diagnostic information explaining, pre...
详细信息
ISBN:
(纸本)3540672826
Boolean Equation systems (BESs) provide a useful framework for the verification of concurrent finite-state systems. In practice, it is desirable that a BES resolution also yields diagnostic information explaining, preferably in a concise way, the truth value computed for a given variable of the BES. Using a representation of BESs as extended boolean graphs (EBGs), we propose a characterization of full diagnostics (i.e., both examples and counterexamples) as a particular class of subgraphs of the EBG associated to a BES. We provide algorithmsthat compute examples and counterexamples in linear time and can be straightforwardly used to extend known (global or local) BES resolution algorithms with diagnostic generation facilities.
this paper presents the Software Measurement analysis and Reliability Toolkit (SMART) which is a research tool for software quality modeling using case-based reasoning (CBR) and other modeling techniques. Modern softw...
详细信息
ISBN:
(纸本)0769509096;076950910X
this paper presents the Software Measurement analysis and Reliability Toolkit (SMART) which is a research tool for software quality modeling using case-based reasoning (CBR) and other modeling techniques. Modern software systems must have high reliability. Software quality models are tools for guiding reliability enhancement activities to high-risk modules for maximum effectiveness and efficiency. A software quality model predicts a quality factor, such as the number of faults in a module, early in the life cycle in time for effective action. Software product and process metrics can be the basis for such fault predictions. Moreover, classification models can identify fault-prone modules. CBR is an attractive modeling method based on automated reasoning processes. However, to our knowledge, few CBR systems for software quality modeling have been developed. SMART addresses this area. there are currently three types of models supported by SMART: classification based on CBR, CBR classification extended with cluster analysis, and module-order models, which predict the rank-order of modules according to a quality factor. An empirical case study of a military command, control, and communications applied SMART at the end of coding. the models built by SMART had a level of accurracy that could be very useful to software developers. Keywords: software reliability, case-based reasoning, data clustering, module-order model, software quality models, analogy models, software tools, fault-prone.
In this paper, we present a generic tool, called FMona, for expressing validation methods. we illustrate its use through the expression of the abstraction technique and its application to infinite or parameterized spa...
详细信息
ISBN:
(纸本)3540672826
In this paper, we present a generic tool, called FMona, for expressing validation methods. we illustrate its use through the expression of the abstraction technique and its application to infinite or parameterized space problems. After a review of the basic results concerning transition systems, we show how abstraction can be expressed within FMona and used to build a reduced system with decidable properties. the FMona tool is used to express the validation steps leading to synthesis of a finite abstract system;then SMV and/or Mona validate its properties.
We present a method that allows to guarantee liveness by construction of a class of timed systems. the method is based on the use of a set of structural properties which can be checked locally at low cost. We provide ...
详细信息
ISBN:
(纸本)3540672826
We present a method that allows to guarantee liveness by construction of a class of timed systems. the method is based on the use of a set of structural properties which can be checked locally at low cost. We provide sufficient conditions for liveness preservation by parallel composition and priority choice operators. the latter allow to restrict a system's behavior according to a given priority order on its actions. We present several examples illustrating the use of the results, in particular for the construction of live controllers.
BDD-based symbolic model checking has been successful in verification of a wide range of systems. Recently, constraint-based approaches, which use arithmetic constraints as a symbolic representation, have been used in...
详细信息
ISBN:
(纸本)3540672826
BDD-based symbolic model checking has been successful in verification of a wide range of systems. Recently, constraint-based approaches, which use arithmetic constraints as a symbolic representation, have been used in symbolic model checking of infinite-state systems. We argue that use of constraint-based model checking is not limited to infinite-state systems. It can also be used as an alternative to BDD-based model checking for systems with integer variables which have finite but large domains. In this paper we investigate the trade-offs between these two approaches experimentally. We compare the performance of BDD-based model checker SMV to the performance of our constraint-based model checker on verification of several asynchronous concurrent systems. the results indicate that constraint-based model checking is a viable option for verification of asynchronous concurrent systems with large integer domains.
We present a method that allows to verify parameterized networks of finite state processes. Our method is based on three main ideas. the first one consists in modeling an infinite family of networks by a single WS1S t...
详细信息
ISBN:
(纸本)3540672826
We present a method that allows to verify parameterized networks of finite state processes. Our method is based on three main ideas. the first one consists in modeling an infinite family of networks by a single WS1S transition system, that is, a transition system whose variables are set (2nd-order) variables and whose transitions are described in WS1S. then, we present methods that allow to abstract a WS1S system into a finite state system that can be model-checked. Finally, in order to verify liveness properties, we present an algorithm that allows to enrich the abstract system with strong fairness conditions while preserving safety of the abstraction. We implemented our method in a tool, called PAX, and applied it to several examples.
the proceedings contain 48 papers. the special focus in this conference is on Computer Aided Verification. the topics include: Applying formal methods to cryptographic protocol analysis;Boolean satisfiability algorith...
ISBN:
(纸本)3540677704
the proceedings contain 48 papers. the special focus in this conference is on Computer Aided Verification. the topics include: Applying formal methods to cryptographic protocol analysis;Boolean satisfiability algorithms and applications in electronic design automation;verification of infinite-state and parameterized systems;an abstraction algorithm for the verification of generalized c-slow designs;achieving scalability in parallel reachability analysis of very large circuits;an automata-theoretic approach to reasoning about infinite-state systems;automatic verification of parameterized cache coherence protocols;binary reachability analysis of discrete pushdown timed automata;Boolean satisfiability with transitivity constraints;bounded model construction for monadic second-order logics;combining decision diagrams and sat procedures for efficient symbolic model checking;on the completeness of compositional reasoning;counterexample-guided abstraction refinement;decision procedures for inductive Boolean functions based on alternating automata;a discrete strategy improvement algorithm for solving parity games;efficient algorithms for model checking pushdown systems;efficient detection of global properties in distributed systems using partial-order methods;efficient reachability analysis of hierarchical reactive machines;formal verification of VLIW microprocessors with speculative execution;liveness and acceleration in parameterized verification;mechanical verification of an ideal incremental ABR conformance algorithm;model checking continuous-time Markov chains by transient analysis;model-checking for hybrid systems by quotienting and constraints solving;efficient reachability analysis for verification and falsification and symbolic techniques for parametric reasoning about counter and clock systems.
this paper describes an experience in formal specification and fault tolerant behavior validation of a railway critical system. the work, performed in the context of a real industrial project, had the following main t...
详细信息
ISBN:
(纸本)3540672826
this paper describes an experience in formal specification and fault tolerant behavior validation of a railway critical system. the work, performed in the context of a real industrial project, had the following main targets: (a) to validate specific safety properties in the presence of byzantine system components or of some hardware temporary faults;(b) to design a formal model of a critical railway system at a right level of abstraction so that could be possible to verify certain safety properties and at the same time to use the model to simulate the system. For the model specification we used the PROMELA language, while the verification was performed using the SPIN model checker. Safety properties were specified by means of both assertions and temporal logic formulae. To make the problem of validation tractable in the SPIN environment, we used ad hoc abstraction techniques.
暂无评论