• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 3,025
Next 10 →

Alloy: A Lightweight Object Modelling Notation

by Daniel Jackson , 2001
"... Alloy is a little language for describing structural properties. It offers a declaration syntax compatible with graphical object models, and a set-based formula syntax powerful enough to express complex constraints and yet amenable to a fully automatic semantic analysis. Its meaning is given by tr ..."
Abstract - Cited by 459 (17 self) - Add to MetaCart
by translation to an even smaller (formally defined) kernel. This paper presents the language in its entirety, and explains its motivation, contributions and deficiencies.

JTN: A Java-Targeted Graphic Formal Notation for Reactive and Concurrent Systems

by Eva Coscia, Gianna Reggio - Fundamental Approaches to Software Engineering (FASE'99), volume 1577 of Lecture Notes in Computer Science , 1999
"... . JTN is a formal graphic notation for Java-targeted design specifications, that are specifications of systems that will be implemented using Java. JTN is aimed to be a part of a more articulated project for the production of a development method for reactive/concurrent/distributed systems. The star ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
. JTN is a formal graphic notation for Java-targeted design specifications, that are specifications of systems that will be implemented using Java. JTN is aimed to be a part of a more articulated project for the production of a development method for reactive/concurrent/distributed systems

Functional Memory Faults: A Formal Notation and a Taxonomy

by Ad Van De, Ad J. Goor, Zaid Al-ars , 2000
"... This pap er presents a notation for describing functional fault models, which may occur in memory devices. Using this notation, the spaceofall possible memory faults has been constructed. It has been shown that this space is in#nite, and contains the currently established functional fault models. N ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
This pap er presents a notation for describing functional fault models, which may occur in memory devices. Using this notation, the spaceofall possible memory faults has been constructed. It has been shown that this space is in#nite, and contains the currently established functional fault models

Introducing Formal Notations in the Development of Object-Based Distributed Applications

by Simon Pickin, Carlos Sánchez, Juan Carlos Yelmo, Juan José Gil, Emilio Rodríguez, Juan Jos� Gil , 1996
"... this article is to contribute to the integration in the development of distributed applications of three basic technologies, namely object-oriented analysis and design (OOA/OOD), Formal Description Techniques (FDTs) and object-based distributed architectures, in our case, the Object Managment Group ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
this article is to contribute to the integration in the development of distributed applications of three basic technologies, namely object-oriented analysis and design (OOA/OOD), Formal Description Techniques (FDTs) and object-based distributed architectures, in our case, the Object Managment Group

Embedding a Formal Notation: Embedding of Z in the Higher Order Logics of PVS And HOL

by Andew M Gravell, Chris H Pratten - IN INT. CONF. THEOREM PROVING IN HIGHER ORDER LOGICS (TPHOLS), SUPPLEMENTARY PROCEEDINGS , 1998
"... In this paper, we consider the problem of embedding formal notations. In particular, we describe our experiences of automating the embedding of Z specifications into the notations of the PVS and HOL theorem provers. This paper is motivated by our experiences of constructing a prototype tool for embe ..."
Abstract - Add to MetaCart
In this paper, we consider the problem of embedding formal notations. In particular, we describe our experiences of automating the embedding of Z specifications into the notations of the PVS and HOL theorem provers. This paper is motivated by our experiences of constructing a prototype tool

A theory of timed automata

by Rajeev Alur , 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract - Cited by 2651 (32 self) - Add to MetaCart
of real-time systems whose correctness depends on relative magnitudes of different delays. Consequently, timed automata [7] were introduced as a formal notation to model the behavior of real-time systems. Its definition provides a simple way to annotate state-transition graphs with timing constraints

Document Flow Model: A Formal Notation for Modelling Asynchronous Web Services Composition

by Jingtao Yang, Corina Cîrstea, Peter Henderson , 2005
"... This paper presents a formal notation for modelling asynchronous web services composition, using context and coordination mechanisms. Our notation specifies the messages that can be handled by different web services, and describes a system of inter-related web services as the flow of documents betwe ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This paper presents a formal notation for modelling asynchronous web services composition, using context and coordination mechanisms. Our notation specifies the messages that can be handled by different web services, and describes a system of inter-related web services as the flow of documents

Notes On Formalizing Context

by John McCarthy , 1993
"... These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit axiomatizat ..."
Abstract - Cited by 417 (9 self) - Add to MetaCart
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit

Running Head: Space & Syntax Formal notations are diagrams: evidence from a production task By

by David Landy, Robert L. Goldstone
"... Space & Syntax Although a general sense of the magnitude, quantity, or numerosity of objects is common both in untrained people and in animals, the abilities to deal exactly with large quantities and to reason precisely in complex but well-specified situations—to behave formally, that is—are ski ..."
Abstract - Add to MetaCart
measures on naturalistic tasks, that the some of the same cognitive resources involved in representing spatial relations and proximities are also involved in representing symbolic notations: in short, formal notations are a kind of diagram. We examine self-generated productions in the domains

Rapport de recherche no. 247 28 avril 1995 A FORMAL NOTATION FOR THE RULES OF

by Function Point Analysis, K. Et Abran, Keith Paton, Alain Abran
"... This paper defines a formal notation (N) for software designs, shows that the notation N is consistent with the language of the the CPM shows that FPA can be expressed as a program (P) operating on a design expressed in N shows that the program P can be expressed in 17 steps of which 12 are ..."
Abstract - Add to MetaCart
This paper defines a formal notation (N) for software designs, shows that the notation N is consistent with the language of the the CPM shows that FPA can be expressed as a program (P) operating on a design expressed in N shows that the program P can be expressed in 17 steps of which 12
Next 10 →
Results 11 - 20 of 3,025
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University