Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Computing Methodologies (I) > Artificial Intelligence (I.2) > Automatic Programming (I.2.2)  
 
Options:
 
  1-10 of 55 Reviews about "Automatic Programming (I.2.2)": Date Reviewed
  Performance-aware server architecture recommendation and automatic performance verification technology on IaaS cloud
Yamato Y. Service Oriented Computing and Applications 11(2): 121-135, 2017.  Type: Article

Yamato proposes “a server architecture recommendation and automatic performance verification technology, which recommends and verifies appropriate server architecture on an infrastructure as a service (IaaS) cloud with bare m...

Dec 15 2017
  A devil’s advocate against termination of direct recursion
Frühwirth T.  PPDP 2015 (Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, Siena, Italy, Jul 14-16, 2015) 103-113, 2015.  Type: Proceedings

A totally correct system terminates. Instead of establishing termination directly, this paper describes a technique based on non-termination. This technique is statically derivable from the program text and produces non-termination res...

Aug 12 2015
  Matrix code
Van Emden M. Science of Computer Programming 843-21, 2014.  Type: Article

Imperative programming verification is a serious problem! Parallel development of proof and code for imperative programming is the proposed solution. A new language is presented to create a proof in parallel with the code called matrix...

Aug 27 2014
  Proving program termination
Cook B., Podelski A., Rybalchenko A. Communications of the ACM 54(5): 88-98, 2011.  Type: Article

For decades, the best approach to attacking the decision problem (proving whether a given program will terminate in a finite amount of time) has been to use monolithic ranking functions. These are usually a combination of a conditional...

Jul 8 2011
  Semantics-based context-aware dynamic service composition
Fujii K., Suda T. ACM Transactions on Autonomous and Adaptive Systems 4(2): 1-31, 2009.  Type: Article

There is a growing demand for new mobile and pervasive environments where software services, devices, and resources can be selected and combined to build flexible and adaptive applications. Pervasive environments are characterized by r...

Aug 13 2010
  Empirical hardness models: methodology and a case study on combinatorial auctions
Leyton-Brown K., Nudelman E., Shoham Y. Journal of the ACM 56(4): 1-52, 2009.  Type: Article

It took a decade of work to turn a set of fresh ideas into a mature approach. This was the case with empirical hardness models, a new area in algorithmics, where machine learning is used to predict the computational cost of an algorith...

Jul 1 2010
  Autonomic specification of self-protection for distributed MARF with ASSL
Mokhov S., Vassev E.  C3S2E 2009 (Proc. of the 2nd Canadian Conference on Computer Science and Software Engineering, Montreal, Quebec, Canada, May 19-21, 2009) 175-183, 2009.  Type: Proceedings

Analysis services scripting language (ASSL) is a specification language for autonomic systems. Its goal is to provide a way to specify self-protecting systems that are able to monitor and repair themselves....

Jan 5 2010
  Deriving state machines from TinyOS programs using symbolic execution
Kothari N., Millstein T., Govindan R.  IPSN 2008 (Proceedings of the 7th International Conference on Information Processing in Sensor Networks, St. Louis, Missouri, Apr 22-24, 2008) 271-282, 2008.  Type: Proceedings

Kothari et al. present FSMGen, a tool for automatically inferring and finding finite state machines (FSMs) for a TinyOS application or system component, by analyzing the nesC code in which the application or component was written. The ...

Jan 28 2009
  Imperative-program transformation by instrumented-interpreter specialization
Debois S. Higher-Order and Symbolic Computation 21(1-2): 37-58, 2008.  Type: Article

The interpretive approach is an appealing program transformation technique. Loosely speaking, it amounts to designing a nonstandard interpreter that exhibits a particular good behavior with regard to some criterion, and then specializi...

Jan 22 2009
  Automatic program development: a tribute to Robert Paige
Danvy O., Mairson H., Henglein F., Pettorossi A., Springer, 2008. 274 pp.  Type: Book

When asked to review this book, my initial reaction was not to accept, since I am not a specialist in automatic program development. However, when I noticed the qualification “A Tribute to Robert Paige,” I changed m...

Dec 15 2008
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy