While optimists argue that though technology always destroy jobs, it also creates new jobs, pessimists argue that the speed in which information technology is currently destroying jobs is unparalleled.Moshe Y. Vardi Page 5
Centuries before George Boole and Charles Babbage, the notion of binary encoding was well known and apparently even used! Julius Caesar was known to use a simple rotational cipher. Francis Bacon devised a binary encoding scheme …
Vinton G. Cerf Page 7DEPARTMENT: Letters to the Editor
Though I agree with the opening lines of "A New Software Engineering" (Dec. 2014) outlining the "promise of rigorous, disciplined, professional practices," we must also look at "craft" in software engineering if we hope to raise …
CACM Staff Pages 8-9DEPARTMENT: BLOG@CACM
Mark Guzdial questions the practice of teaching programming to new CS students by having them practice programming largely on their own.Mark Guzdial Pages 12-13COLUMN: News
Companies are creating technological solutions for individuals, then generalizing them to broader populations that need similar assistance.Keith Kirkpatrick Pages 21-23COLUMN: Privacy and security
A proposal for a framework for code requirements addressing primary sources of vulnerabilities for building systems.Carl Landwehr Pages 24-26COLUMN: Economic and business dimensions
Soundy is the new sound.Benjamin Livshits, Manu Sridharan, Yannis Smaragdakis, Ondřej Lhoták, J. Nelson Amaral, Bor-Yuh Evan Chang, Samuel Z. Guyer, Uday P. Khedker, Anders Møller, Dimitrios Vardoulakis Pages 44-46SECTION: Practice
MBT has positive effects on efficiency and effectiveness, even if it only partially fulfills high expectations.Robert V. Binder, Bruno Legeard, Anne Kramer Pages 52-56SECTION: Contributed articles
Model checking and logic-based learning together deliver automated support, especially in adaptive and autonomous systems.Dalal Alrajeh, Jeff Kramer, Alessandra Russo, Sebastian Uchitel Pages 65-72SECTION: Review articles
As the equivalence problem is essential in many applications, we need algorithms that avoid the worst-case complexity as often as possible. In "Hacking Nondeterminism with Induction and Coinduction," Filippo Bonchi and Damien …
Thomas A. Henzinger, Jean-François Raskin Page 86
We introduce bisimulation up to congruence as a technique for proving language equivalence of nondeterministic finite automata.Filippo Bonchi, Damien Pous Pages 87-95COLUMN: Last byte
A popular logic game involves figuring out an arrangement of people sitting around a circular table based on hints about, say, their relationships. Here, we aim to determine the smallest number of hints sufficient to specify …
Dennis Shasha Page 104