Part 1 Syntax of the core: reserved words special constants comments identifiers lexical analysis infixed operators derived forms grammar syntactic restrictions. Part 2 Syntax of modules: reserved words identifiers infixed operators grammar for modules syntactic restrictions. Part 3 Static semantics for the core: simple objects compound objects projection, injection and modification types and type functions type schemes scope of explicit type variables non-expansive expressions closure type structures and type environments inference rules further restrictions. Part 4 Static semantics for modules: semantic objects type realization signature instantiation functor signature instantiation enrichment signature matching inference rules. Part 5 Dynamic semantics for the core: reduced syntax simple objects compound objects basic values basic exceptions function closures inference rules. Part 6 Dynamic semantics for modules: reduced syntax compound objects inference rules. Part 7 Programmes. Part 8 Appendices.

The Definition of Standard ML (Revised)

We present a specification language and algorithms for the online and offline monitoring of synchronous systems including circuits and embedded systems. Such monitoring is useful not only for testing, but also under actual deployment. The specification language is simple and expressive; it can describe both correctness/failure assertions along with interesting statistical measures that are useful for system profiling and coverage analysis. The algorithm for online monitoring of queries in this language follows a partial evaluation strategy: it incrementally constructs output streams from input streams, while maintaining a store of partially evaluated expressions for forward references. We identify a class of specifications, characterized syntactically, for which the algorithm's memory requirement is independent of the length of the input streams. Being able to bound memory requirements is especially important in online monitoring of large input streams. We extend the concepts used in the online algorithm to construct an efficient offline monitoring algorithm for large traces. We have implemented our algorithm and applied it to two industrial systems, the PCI bus protocol and a memory controller. The results demonstrate that our algorithms are practical and that our specification language is sufficiently expressive to handle specifications of interest to industry.

/pdf/lola-runtime-monitoring-of-synchronous-systems-1ko1unxh54.pdf

LOLA: runtime monitoring of synchronous systems

In spite of the widespread use of CAD systems for design and CAE systems for analysis, the two processes are not well integrated because CAD and CAE models inherently use different types of geometric models and there currently exists no generic, unified model that allows both design and analysis information to be specified and shared. In this paper, a new approach called the CAD/CAE-integrated approach is proposed and implemented by a feature-based non-manifold modelling system. The system creates and manipulates a single master model containing different types of all of the geometric models required for CAD and CAE. Both a solid model (for CAD) and a non-manifold model (for CAE) are immediately extracted from the master model through a selection process. If a design change is required, the master model is modified by the feature modelling capabilities of the system. As a result, the design and analysis models are modified simultaneously and maintained consistently. This system also supports feature-based multi-resolution and multi-abstraction modelling capabilities providing the CAD model at different levels of detail and the CAE model at various levels of abstraction.

A CAD-CAE integration approach using feature-based multi-resolution and multi-abstraction modelling techniques

: This project was concerned with the development of correct and reusable software through the use of higher order abstractions (function, control, assignment, process) and reflection. A semantic framework for these notions will be the basis of an experimental system for manipulating and reasoning about programs. The goals of this project were the development of logical formalisms for reasoning about programs that use abstractions and reflection, and the application of these theoretical results to selected software problems. Example applications include (1) clarification of existing programming paradigms, (2) analysis of existing and proposed languages used in the DARPA community for specifying, writing, and transforming programs, and (3) development and implementation of tools for computer aided reasoning about and operating on programs. The accomplishments of this project fit into four categories: (1) logics for reasoning about function and control abstractions; (2) logics for reasoning about data mutation; (3) logics for reasoning about function and control abstractions in the presence of mutable data; and (4) applying methodology for reasoning about programs to the mechanical verification of hardware.

Mathematical Theory of Computation

International Symposium on Quality Electronic Design

This paper describes a formal method for checking the equivalence between the finite state machine with data path (FSMD) model of the high-level behavioural specification and the FSMD model of the behaviour transformed by the scheduler. The method consists in introducing cutpoints in one FSMD, visualizing its computations as concatenation of paths from cutpoints to cutpoints and finally, identifying equivalent finite path segments in the other FSMD; the process is then repeated with the FSMDs interchanged. The method is strong enough to accommodate merging of the segments in the original behaviour by the typical scheduler such as DLS, a feature very common in scheduling but not captured by many works reported in the literature. It also handles arithmetic transformations.

A Formal Verification Method of Scheduling in High-level Synthesis

ML for the Working Programmer (2nd edition) by L. C. Paulson, Cambridge University Press, 1996.

In a wireless network, messages need to be sent on in an optimized way to preserve the energy of the network. A minimum connected dominating set (MCDS) offers an optimized way of sending messages. However, MCDS construction is a NP-Hard problem. In this paper, we propose a new degree-based greedy approximation algorithm named as Connected Pseudo Dominating Set Using 2 Hop Information (CPDS2HI), which reduces the CDS size as much as possible. Our method first constructs the CDS and then reduces its size further by excluding some of the CDS nodes cleverly without any loss in coverage or connectivity. The simulation results show that our method outperforms existing CDS construction algorithms in terms of both the CDS size and construction cost. CPDS2HI retains the current best performance ratio of ( 4.8 + ln 5 ) | o p t | + 1.2 , |opt| being the size of an optimal CDS of the network, and has the best time complexity of O(D), where D is the network diameter. To the best of our knowledge this is the most time efficient and size-optimal CDS construction algorithm. It has a linear message complexity of O(nΔ), where n is the network size and Δ is the maximum degree of all the nodes.

Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set

Distributed construction of minimum Connected Dominating Set in wireless sensor network using two-hop information

This paper provides a rationale for its abstract data definitions of geometric features. These definitions are used as the basis of a suite of functions to support feature modelling. It assumes that implementations of the proposed functions will make use of a solid modelling kernel that supports objects with a disjoint cellular structure and persistent cell identifiers. It is intended that most of the functions required for the manipulation of features can be provided by overloaded kernel functions; new functions are necessary only to provide feature specific operations. Unlike most features in the literature, the features of this paper are not design features, manufacturing features or features for any other specific application. They are geometric structures that support such applications. Thus, the disjoint cellular structure of a modern solid modelling kernel is enhanced to include a hierarchy of geometrically overlapping features. A feature at any node in the hierarchy is defined in terms of instances of multiple sub-features combined using any object construction function of the kernel. Such instancing allows multiple versions of any feature to be modified simultaneously via the master.

Chris Reade

Papers

A Formal Verification Method of Scheduling in High-level Synthesis

ML for the Working Programmer (2nd edition) by L. C. Paulson, Cambridge University Press, 1996.

Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set

Distributed construction of minimum Connected Dominating Set in wireless sensor network using two-hop information

A kernel for geometric features