Composing first-class transactions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Composing first-class transactions

Full text

Pdf (1.07 MB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 16 , Issue 6 (November 1994) table of contents

Pages: 1719 - 1736

Year of Publication: 1994

ISSN:0164-0925

Authors

Nicholas Haines	Carnegie Mellon Univ., Pittsburgh, PA
Darrell Kindred	Carnegie Mellon Univ., Pittsburgh, PA
J. Gregory Morrisett	Carnegie Mellon Univ., Pittsburgh, PA
Scott M. Nettles	Carnegie Mellon Univ., Pittsburgh, PA
Jeannette M. Wing	Carnegie Mellon Univ., Pittsburgh, PA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 22, Citation Count: 14

Additional Information:

references cited by index terms review collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/197320.197346 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ATKINSON, M., BAILEY, P., CHISOLM, K., COCKSHOTT, W., AND MOARISON, R. 1983. An approach to persistent programming. Comput. J. ~6, 4,360-365.
	2	COOPER, E. AND DRAVES, R. 1988. C Threads. Tech. Rep. CMU-CS-88-154 (June), Computer Science Dept., Carnegie Mellon Univ., Pittsburgh, Pa.
	3	COOPE1R, E. AND I~,~ORRISETT, J. G. 1990. Adding threads to Standard ME. Tech. Rep. CMU- CS-90-186 (Dec.), School of Computer Science, Carnegie Mellon Univ., Pittsburgh, Pa.
	4	David L. Detlefs , Maurice P. Herlihy , Jeannette M. Wing, Inheritance of Synchronization and Recovery Properties in Avalon/C++, Computer, v.21 n.12, p.57-69, December 1988 [doi>10.1109/2.16189 ]
	5	Jeffrey L. Eppinger , Lily B. Mummert , Alfred Z. Spector, Camelot and Avalon: a distributed transaction facility, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991
	6	Daniel P. Friedman , Christopher T. Haynes, Constraining control, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.245-254, January 14-16, 1985, New Orleans, Louisiana, United States [doi>10.1145/318593.318654]
	7	R. Goldman , R. P. Gabriel , C. Sexton, Qlisp: an interim report, Proceedings of the US/Japan workshop on Parallel Lisp on Parallel Lisp: languages and systems, p.161-181, June 1990, Sendai, Japan
	8	HARBmON, S. 1992. Moduta-3. Prentice-Hall, Englewood Cliffs, N.J.
	9	Rober Haskin , Yoni Malachi , Gregory Chan, Recovery management in QuickSilver, ACM Transactions on Computer Systems (TOCS), v.6 n.1, p.82-108, Feb. 1988 [doi>10.1145/35037.35060]
	10	HELLAND, P. 1985. Transaction monitoring facility. Database Eng. 8, 1 (June), 9-18.
	11	HUMM, B. G. 1993. An extended scheduling mechanism for nested transactions. In Proceedings of the International IEEE Workshop on Object-Omen~ation ~n Operating Systems, IEEE, New York.
	12	Henry Lieberman , Carl Hewitt, A real-time garbage collector based on the lifetimes of objects, Communications of the ACM, v.26 n.6, p.419-429, June 1983 [doi>10.1145/358141.358147]
	13	Bruce G. Lindsay , Laura M. Haas , C. Mohan , Paul F. Wilms , Robert A. Yost, Computation and communication in R*: a distributed database manager, ACM Transactions on Computer Systems (TOCS), v.2 n.1, p.24-38, February 1984 [doi>10.1145/2080.357390]
	14	Barbara Liskov , Robert Scheifler, Guardians and Actions: Linguistic Support for Robust, Distributed Programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.3, p.381-404, July 1983 [doi>10.1145/2166.357215]
	15	Robin Milner , Mads Tofte , Robert Harper, The definition of Standard ML, MIT Press, Cambridge, MA, 1990
	16	MORmSETT, J. G. 1993. Generalizing first-class stores. In Proceedings of the A CM SIGPLAN Workshop on State ~ ProgramT~ng Lang~age~, ACM, New York, 73-87.
	17	J. Gregory Morrisett , Andrew Tolmach, Procs and locks: a portable multiprocessing platform for standard ML of New Jersey, Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.198-207, May 19-22, 1993, San Diego, California, United States
	18	J. E.B. Moss, Nested transactions: an approach to reliable distributed computing, Massachusetts Institute of Technology, Cambridge, MA, 1985
	19	NETTLES, S. M. 1994. Safe and efficient transaction support for heap-based languages. Computer Science Dept., Carnegie Mellon Univ., Pittsburgh, Pa., Ph.D thesis in progress.
	20	NETTLES, S. M. AND WING, J. M. 1992. Persistence + Undoability = Transactions. In Proceedings of HICSS-25, Washington, D.C. IEEE Computer Society Press. Also CMU-CS-91-173, Carnegie Mellon Univ., Pittsburgh, Pa., August 1991.
	21	James O'Toole , Scott Nettles , David Gifford, Concurrent compacting garbage collection of a persistent heap, Proceedings of the fourteenth ACM symposium on Operating systems principles, p.161-174, December 05-08, 1993, Asheville, North Carolina, United States
	22	PAUSCH, R. 1988. Adding input and output to the transactional model. Tech. Rep. CMU-0S- 88-171, Computer Science Dept., Carnegie Mellon Univ., Pittsburgh, Pa.
	23	Jonathan Rees, The scheme of things: the June 1992 meeting, ACM SIGPLAN Lisp Pointers, v.V n.4, p.40-45, Oct. 1992 [doi>10.1145/382126.382667]
	24	ROVNER, P. 1986. Extending Modula-2 to build large, integrated systems. IEEE Soft. 3, 6, 46-57.
	25	M. Satyanarayanan , Henry H. Mashburn , Puneet Kumar , David C. Steere , James J. Kistler, Lightweight recoverable virtual memory, Proceedings of the fourteenth ACM symposium on Operating systems principles, p.146-160, December 05-08, 1993, Asheville, North Carolina, United States
	26	SHRIVASTAVA, S., DIXON, G., HEDaYATI, F., PA~mNCTON, G., AND WHEATER, S. 1988. A technical overview of Arjuna: A system for reliable distributed computing. Tech. Rep., Computing Laboratory, Univ. of Newcastle upon Tyne, U.K.
	27	Andrew P. Tolmach , Andrew W. Appel, Debuggable concurrency extensions for standard ML, ACM SIGPLAN Notices, v.26 n.12, p.120-131, Dec. 1991
	28	David Ungar, Generation Scavenging: A non-disruptive high performance storage reclamation algorithm, Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments, p.157-167, April 1984
	29	WARlqEN, D. 1983. An abstract PROLOG instruction set. Tech. Rap. 309, AI Center, SP~I International, Menlo Park, Calif.
	30	Jeannette M. Wing , Manuel Faehndrich , Nick Haines , Karen Kietzke , Darrell Kindred , J. G Morrisett , Scott Nettles, Venari/ML Interfaces and Examples, Carnegie Mellon University, Pittsburgh, PA, 1993

CITED BY 14

	Peter Thiemann, User-level transactional programming in Haskell, Proceedings of the 2006 ACM SIGPLAN workshop on Haskell, September 17-17, 2006, Portland, Oregon, USA
	M. Patiño-Martínez , R. Jiménez-Peris , S. Arévalo, Implementing transactions using Ada exceptions: which features are missing?, ACM SIGAda Ada Letters, v.XXI n.3, September 2001
	Alexander Romanovsky , Jörg Kienzle, Action-oriented exception handling in cooperative and competitive concurrent object-oriented systems, Advances in exception handling techniques, Springer-Verlag New York, Inc., New York, NY, 2001
	Katherine F. Moore , Dan Grossman, High-level small-step operational semantics for transactions, ACM SIGPLAN Notices, v.43 n.1, January 2008
	M. Papazoglou , A. Delis , A. Bouguettaya , M. Haghjoo, Class Library Support for Workflow Environments and Applications, IEEE Transactions on Computers, v.46 n.6, p.673-686, June 1997
	John Field , Carlos A. Varela, Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments, ACM SIGPLAN Notices, v.40 n.1, p.195-208, January 2005
	Paweł T. Wojciechowski, Isolation-only transactions by typing and versioning, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.70-81, July 11-13, 2005, Lisbon, Portugal
	Suresh Jagannathan , Jan Vitek , Adam Welc , Antony Hosking, A transactional object calculus, Science of Computer Programming, v.57 n.2, p.164-186, August 2005
	Lukasz Ziarek , Philip Schatz , Suresh Jagannathan, Modular Checkpointing for Atomicity, Electronic Notes in Theoretical Computer Science (ENTCS), v.174 n.9, p.85-115, June, 2007
	Cormac Flanagan, Hybrid type checking, ACM SIGPLAN Notices, v.41 n.1, p.245-256, January 2006
	Dan Grossman, The transactional memory / garbage collection analogy, ACM SIGPLAN Notices, v.42 n.10, October 2007
	Antony L. Hosking , Jiawan Chen, PM3: An Orthogonal Persistent Systems Programming Language - Design, Implementation, Performance, Proceedings of the 25th International Conference on Very Large Data Bases, p.587-598, September 07-10, 1999
	Tom Chothia , Dominic Duggan, Abstractions for fault-tolerant global computing, Theoretical Computer Science, v.322 n.3, p.567-613, 6 September 2004
	Antony L. Hosking , Jiawan Chen, Mostly-copying reachability-based orthogonal persistence, ACM SIGPLAN Notices, v.34 n.10, p.382-398, Oct. 1999

INDEX TERMS

Primary Classification:
D. Software
D.3 PROGRAMMING LANGUAGES
D.3.3 Language Constructs and Features
Subjects: Control structures

General Terms:
Languages, Reliability

Keywords:
Standard ML, modules, persistence, recovery, serializability, skeins, threads, transactions, undoability

REVIEW

"R. Clayton : Reviewer"

A computation is undoable if it can revert to its pre-execution state at any time before it ends; it is persistent if its results remain after it has successfully ended; and it is serializable if it produces the same results independent of oth more...

Collaborative Colleagues:

Nicholas Haines: colleagues

Darrell Kindred: colleagues

J. Gregory Morrisett: colleagues

Scott M. Nettles: colleagues

Jeannette M. Wing: colleagues

Peer to Peer - Readers of this Article have also read: