Results 1  10
of
220,268
SUCCESSORINVARIANT FIRSTORDER LOGIC ON FINITE STRUCTURES
"... Abstract. We consider successorinvariant firstorder logic (FO + succ)inv, consisting of sentences Φ involving an “auxiliary ” binary relation S such that (A, S1)  = Φ ⇐⇒ (A, S2)  = Φ for all finite structures A and successor relations S1, S2 on A. A successorinvariant sentence Φ has a welldefin ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We consider successorinvariant firstorder logic (FO + succ)inv, consisting of sentences Φ involving an “auxiliary ” binary relation S such that (A, S1)  = Φ ⇐⇒ (A, S2)  = Φ for all finite structures A and successor relations S1, S2 on A. A successorinvariant sentence Φ has a well
Successorinvariance in the finite
 In Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS’03
, 2003
"... A firstorder sentence θ of vocabulary σ ∪ {S} is successorinvariant in the finite if for every finite σstructure M and successor relations S1 and S2 on M, (M, S1)  = θ ⇐ ⇒ (M, S2)  = θ. In this paper I give an example of a nonfirstorder definable class of finite structures which is, however, ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
A firstorder sentence θ of vocabulary σ ∪ {S} is successorinvariant in the finite if for every finite σstructure M and successor relations S1 and S2 on M, (M, S1)  = θ ⇐ ⇒ (M, S2)  = θ. In this paper I give an example of a nonfirstorder definable class of finite structures which is, however
Model Checking for SuccessorInvariant FirstOrder Logic on MinorClosed Graph Classes
"... Abstract—Model checking problems for first and monadic secondorder logic on graphs have received considerable attention in the past, not the least due to their connections to problems in algorithmic graph structure theory. While the model checking problem for these logics on general graphs is comp ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of the respective logics. This remains true even in cases where we require the formulas to be order or successorinvariant, that is, while they can use an order relation, their truth in a given graph must not depend on the particular ordering or successor function chosen. Naturally, the question arises
ModelChecking in Dense Realtime
 INFORMATION AND COMPUTATION
, 1993
"... Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends on t ..."
Abstract

Cited by 329 (7 self)
 Add to MetaCart
Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends
Symbolic Model Checking without BDDs
, 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract

Cited by 910 (74 self)
 Add to MetaCart
& Putnam Procedure [7], can replace BDDs. This new technique avoids the space blow up of BDDs, generates counterexamples much faster, and sometimes speeds up the verification. In addition, it produces counterexamples of minimal length. We introduce a bounded model checking procedure for LTL
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 997 (8 self)
 Add to MetaCart
assignment form and the control dependence graph have been proposed to represent data flow and control flow propertiee of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimization. Although both of these structures are attractive
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
as follows: ffl We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. ffl We present several efficient dynamic drawing algorithms for trees, seriesparallel digraphs, planar stdigraphs, and planar
Results 1  10
of
220,268