scispace - formally typeset
Search or ask a question
Conference

Formal Methods 

About: Formal Methods is an academic conference. The conference publishes majorly in the area(s): Formal methods & Formal verification. Over the lifetime, 4344 publications have been published by the conference receiving 95450 citations.


Papers
More filters
Book ChapterDOI
13 Sep 2004
TL;DR: This is a tutorial paper on the tool Uppaal to be a short introduction on the flavor of timed automata implemented in the tool, to present its interface, and to explain how to use the tool.
Abstract: This is a tutorial paper on the tool Uppaal. Its goal is to be a short introduction on the flavor of timed automata implemented in the tool, to present its interface, and to explain how to use the tool. The contribution of the paper is to provide reference examples and modeling patterns.

1,686 citations

Journal ArticleDOI
01 Jul 2001
TL;DR: Live sequence charts (LSCs) as discussed by the authors allow the distinction between possible and necessary behavior both globally, on the level of an entire chart and locally, when specifying events, conditions and progress over time within a chart.
Abstract: While message sequence charts (MSCs) are widely used in industry to document the interworking of processes or objects, they are expressively weak, being based on the modest semantic notion of a partial ordering of events as defined, eg, in the ITU standard A highly expressive and rigorously defined MSC language is a must for serious, semantically meaningful tool support for use-cases and scenarios It is also a prerequisite to addressing what we regard as one of the central problems in behavioral specification of systems: relating scenario-based inter-object specification to state-machine intra-object specification This paper proposes an extension of MSCs, which we call live sequence charts (or LSCs), since our main extension deals with specifying “liveness”, ie, things that must occur In fact, LSCs allow the distinction between possible and necessary behavior both globally, on the level of an entire chart and locally, when specifying events, conditions and progress over time within a chart This makes it possible to specify forbidden scenarios, for example, and enables naturally specified structuring constructs such as subcharts, branching and iteration

931 citations

Book ChapterDOI
Egon Börger1
01 Jan 2010
TL;DR: In this article, the main ingredients of Abstract State Machines (ASM) for high-level system design and analysis are discussed and a survey of their application highlights in industrial software-based system engineering is presented.
Abstract: We explain the main ingredients of the Abstract State Machines (ASM) method for high-level system design and analysis and survey some of its application highlights in industrial software-based system engineering. We illustrate the method by defining models for three simple control systems (sluice gate, traffic light, package router) and by characterising Event-B machines as a specific class of ASMs.We point to directions for future research and applications of the method in other areas than software engineering.

880 citations

Journal ArticleDOI
01 Jan 2006
TL;DR: In this paper, the authors report results from research that examines characteristics and changes in Web searching from nine studies of five Web search engines based in the US and Europe and find that users are viewing fewer result pages, searchers on US-based web search engines use more query operators, and there are statistically significant differences in the use of Boolean operators and result pages viewed, and one cannot necessary apply results from studies of one particular Web search engine to another web search engine.
Abstract: The Web and especially major Web search engines are essential tools in the quest to locate online information for many people. This paper reports results from research that examines characteristics and changes in Web searching from nine studies of five Web search engines based in the US and Europe. We compare interactions occurring between users and Web search engines from the perspectives of session length, query length, query complexity, and content viewed among the Web search engines. The results of our research shows (1) users are viewing fewer result pages, (2) searchers on US-based Web search engines use more query operators than searchers on European-based search engines, (3) there are statistically significant differences in the use of Boolean operators and result pages viewed, and (4) one cannot necessary apply results from studies of one particular Web search engine to another Web search engine. The wide spread use of Web search engines, employment of simple queries, and decreased viewing of result pages may have resulted from algorithmic enhancements by Web search engine companies. We discuss the implications of the findings for the development of Web search engines and design of online content.

810 citations

Journal ArticleDOI
01 Jul 2001
TL;DR: This tutorial focuses on recent techniques that combine model checking with satisfiability solving, known as bounded model checking, which do a very fast exploration of the state space, and for some types of problems seem to offer large performance improvements over previous approaches.
Abstract: The phrase model checking refers to algorithms for exploring the state space of a transition system to determine if it obeys a specification of its intended behavior. These algorithms can perform exhaustive verification in a highly automatic manner, and, thus, have attracted much interest in industry. Model checking programs are now being commercially marketed. However, model checking has been held back by the state explosion problem, which is the problem that the number of states in a system grows exponentially in the number of system components. Much research has been devoted to ameliorating this problem. In this tutorial, we first give a brief overview of the history of model checking to date, and then focus on recent techniques that combine model checking with satisfiability solving. These techniques, known as bounded model checking, do a very fast exploration of the state space, and for some types of problems seem to offer large performance improvements over previous approaches. We review experiments with bounded model checking on both public domain and industrial designs, and propose a methodology for applying the technique in industry for invariance checking. We then summarize the pros and cons of this new technology and discuss future research efforts to extend its capabilities.

770 citations

Performance
Metrics
No. of papers from the Conference in previous years
YearPapers
202191
202056
2019235
2018123
2017102
2016156