


default search action
Science of Computer Programming, Volume 64
Volume 64, Number 1, January 2007
- Roberto Giacobazzi:

Foreword. 1-2 - Torben Amtoft

, Anindya Banerjee:
A logic for information flow analysis with an application to forward slicing of simple imperative programs. 3-28 - David A. Schmidt:

A calculus of logical relations for over- and underapproximating static analyses. 29-53 - Enric Rodríguez-Carbonell

, Deepak Kapur:
Automatic generation of polynomial invariants of bounded degree using abstract interpretation. 54-75 - Michael Colón:

Polynomial approximations of the relational semantics of imperativeprograms. 76-96 - Sumit Gulwani, George C. Necula:

A polynomial-time algorithm for global value numbering. 97-114 - Robert Clarisó

, Jordi Cortadella
:
The octahedron abstract domain. 115-139 - Cormac Flanagan, Stephen N. Freund

:
Type inference against races. 140-165 - Sarah Thompson, Alan Mycroft

:
Abstract interpretation of combinational asynchronous circuits. 166-183
Volume 64, Number 2, January 2007
- Jean-Marie Jacquet, Gian Pietro Picco:

Introduction to the special issue. 185-186 - Rocco De Nicola

, Daniele Gorla
, Rosario Pugliese
:
Global computing in a dynamic network of tuple spaces. 187-204 - Nur Izura Udzir

, Alan M. Wood, Jeremy L. Jacob:
Coordination with multicapabilities. 205-222 - Alan W. Colman

, Jun Han:
Using role-based coordination to achieve software adaptability. 223-245 - Giovanni Russello, Michel R. V. Chaudron

, Maarten van Steen
, Ibrahim Bokharouss:
An experimental evaluation of self-managing availability in shared data spaces. 246-262
Volume 64, Number 3, February 2007
- Manfred Broy:

Editorial comment to 'About "trivial" software patents: The IsNot case'. 263 - Jan A. Bergstra, Paul Klint:

About "trivial" software patents: The IsNot case. 264-285 - Ian J. Hayes

:
Procedures and parameters in the real-time program refinement calculus. 286-311 - Mark Burgess, Trond Reitan

:
A risk analysis of disk backup or repository maintenance. 312-331 - Jean-Christophe Filliâtre:

Formal proof of a program: Find. 332-340 - Hui Gao, Jan Friso Groote

, Wim H. Hesselink
:
Lock-free parallel and concurrent garbage collection by mark&sweep. 341-374

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














