Stephen A. Edwards

Stephen A. Edwards

Auto-generated profile, based on publicly available information

Stephen A. Edwards

Columbia University, New York, USA

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 January 2003 in Proceedings of the IEEE
Verified
Journal Article
Closed access
ABA. Benveniste
A. Benveniste
PCP. Caspi
P. Caspi
SES.A. Edwards
S.A. Edwards
NHN. Halbwachs
N. Halbwachs
PGP. Le Guernic
P. Le Guernic
RSR. de Simone
R. de Simone
Twelve years ago, Proceedings of the IEEE devoted a special section to the synchronous languages. This paper discusses the improvements, difficulties, and successes that have occured with the synchronous languages since then. Today, synchronous languages have been established as a technology of choice for modeling, specifying, validating, and implementing real-time embedded applications. The paradigm of synchrony has emerged as an engineer-friendly design method based on mathematically sound tools.

1 January 1996
Verified
Book Chapter
Closed access
PDF file
RBRobert K. Brayton
Robert K. Brayton
GHGary D. Hachtel
Gary D. Hachtel
ASAlberto Sangiovanni-Vincentelli
Alberto Sangiovanni-Vincentelli
FSFabio Somenzi
Fabio Somenzi
AAAdnan Aziz
Adnan Aziz
TVTiziano Villa
Tiziano Villa

7 August 2002 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
SES.A. Edwards
S.A. Edwards
Embedded hard real-time software systems often need fine-grained parallelism and precise control of timing, things typical real-time operating systems do not provide. The Esterel language has both, but compiling large Esterel programs has been challenging, producing either needlessly slow or large code. This paper presents the first Esterel compiler able to compile large Esterel programs into fast, small code. By choosing a concurrent control-now graph (CCFG) as its intermediate representation, it preserves many of the control constructs to produce code that can be 100 times faster and half the size than code from other compilers with similar capacity. The primary contribution is an algorithm that generates efficient sequential code from a CCFG. While developed specifically for compiling Esterel, the algorithm could be used to compile other synchronous languages with fine-grained parallelism.

1 August 2006 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
SES.A. Edwards
S.A. Edwards
OTO. Tardieu
O. Tardieu
Typical embedded hardware/software systems are implemented using a combination of C and an HDL such as Verilog. While each is well-behaved in isolation, combining the two gives a nondeterministic model of computation whose ultimate behavior must be validated through expensive (cycle-accurate) simulation. We propose an alternative for describing such systems. Our software/hardware integration medium (shim) model, effectively Kahn networks with rendezvous communication, provides deterministic concurrency. We present the Tiny-shim language for such systems and its semantics, demonstrate how to implement it in hardware and software, and discuss how it can be used to model a real-world system. By providing a powerful, deterministic formalism for expressing systems, designing systems, and verifying their correctness will become easier

1 April 2003 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
PDF file
SEStephen A. Edwards
Stephen A. Edwards
Embedded systems often include a traditional processor capable of executing sequential code, but both control and data-dominated tasks are often more naturally expressed using one of the many domain-specific concurrent specification languages. This article surveys a variety of techniques for translating these concurrent specifications into sequential code. The techniques address compiling a wide variety of languages, ranging from dataflow to Petri nets. Each uses a different method, to some degree chosen to match the semantics of concurrent language. Each technique is considered to consist of a partial evaluator operating on an interpreter. This combination provides a clearer picture of how parts of each technique could be used in a different setting.