Results 1  10
of
548,331
Symbolic backwardsreachability analysis for higherorder pushdown systems
 IN FOSSACS
, 2007
"... Higherorder pushdown systems (PDSs) generalise pushdown systems through the use of higherorder stacks; that is, a nested “stack of stacks ” structure. These systems may be used to model higherorder programs and are closely related to the Caucal hierarchy of infinite graphs and safe higherorder ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
recursion schemes. We generalise higherorder PDSs to higherorder Alternating PDSs (APDSs) and consider the backwardsreachability problem over these systems. This builds on and extends previous work into pushdown systems and contextfree higherorder processes in a nontrivial manner. In particular, we
HigherOrder Abstract Syntax
"... We describe motivation, design, use, and implementation of higherorder abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and other formal systems where matching and substitution or syntax incorporates name binding informat ..."
Abstract

Cited by 358 (18 self)
 Add to MetaCart
We describe motivation, design, use, and implementation of higherorder abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and other formal systems where matching and substitution or syntax incorporates name binding
The Symbol Grounding Problem
, 1990
"... There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This paper describes the "symbol grounding problem": How can the semantic interpretation of a formal symbol system be m ..."
Abstract

Cited by 1072 (18 self)
 Add to MetaCart
of their (nonsymbolic) categorical representations. Higherorder (3) "symbolic representations" , grounded in these elementary symbols, consist of symbol strings describing category membership relations (e.g., "An X is a Y that is Z"). Connectionism is one natural candidate for the mechanism
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
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately
ControlFlow Analysis of HigherOrder Languages
, 1991
"... representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: dataflow analysis, Scheme, LISP, ML, CPS, type recovery, higherorder functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful, ..."
Abstract

Cited by 362 (10 self)
 Add to MetaCart
representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: dataflow analysis, Scheme, LISP, ML, CPS, type recovery, higherorder functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 385 (39 self)
 Add to MetaCart
We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like
Infinite regular games in the higherorder pushdown . . .
, 2011
"... Higherorder pushdown systems extend the idea of pushdown systems by using a “higherorder stack ” (which is a nested stack). More precisely on level 1 this is a standard stack, on level 2 it is a stack of stacks, and so on. We study the higherorder pushdown systems in the context of infinite regu ..."
Abstract
 Add to MetaCart
Higherorder pushdown systems extend the idea of pushdown systems by using a “higherorder stack ” (which is a nested stack). More precisely on level 1 this is a standard stack, on level 2 it is a stack of stacks, and so on. We study the higherorder pushdown systems in the context of infinite
Global ModelChecking of HigherOrder Pushdown Systems
, 2008
"... Pushdown systems equip a finite state system with an unbounded stack memory, and are thus infinite state. By recording the call history on the stack, these systems provide a natural model for recursive procedure calls. Modelchecking for pushdown systems has been wellstudied. The most successful im ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
the winning regions of twoplayer games with reachability, Büchi and parity conditions. Our approach extends the saturation methods of Bouajjani, Esparza and Maler for order1 pushdown systems, and Bouajjani and Meyer for higherorder pushdown systems with a single control state. These techniques begin
Convex Analysis
, 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract

Cited by 5350 (67 self)
 Add to MetaCart
In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a
Formal Ontology and Information Systems
, 1998
"... Research on ontology is becoming increasingly widespread in the computer science community, and its importance is being recognized in a multiplicity of research fields and application areas, including knowledge engineering, database design and integration, information retrieval and extraction. We sh ..."
Abstract

Cited by 878 (11 self)
 Add to MetaCart
shall use the generic term information systems, in its broadest sense, to collectively refer to these application perspectives. We argue in this paper that socalled ontologies present their own methodological and architectural peculiarities: on the methodological side, their main peculiarity
Results 1  10
of
548,331