327,953 Hits in 5.3 sec

On Flat Programs with Lists [chapter]

Marius Bozga, Radu Iosif
Lecture Notes in Computer Science  
Surprisingly, even with these simplifying conditions, verifying safety and termination for programs working on heaps with more than one cycle are undecidable, whereas decidability can be established when  ...  In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data structures.  ...  From List Programs to Counter Automata Let P be a flat list program without destructive updates, and H(x), x = {x 1 , . . . , x k } be a parametric heap with at most one cycle.  ... 
doi:10.1007/978-3-540-69738-1_9 dblp:conf/vmcai/BozgaI07 fatcat:xvzzz2ae7bb63cu7tb4e54y2ti

L-FLAT: Logtalk Toolkit for Formal Languages and Automata Theory [article]

Paulo Moura, Artur Miguel Dias
2011 arXiv   pre-print
The use of L-FLAT in educational environments is enhanced by supporting Mooshak, a web application that features automatic grading of submitted programs.  ...  We describe L-FLAT, a Logtalk Toolkit for teaching Formal Languages and Automata Theory.  ...  PM is the developer of the Logtalk programming language and a co-developer of L-FLAT. AMD is a co-developer of the original P-FLAT toolkit and a co-developer of L-FLAT. Acknowledgements.  ... 
arXiv:1112.3783v1 fatcat:weafasipire2vmqdcbuibj2xzm

Logic program transformation through generalization schemata [extended abstract] [chapter]

Pierre Flener, Yves Deville
1996 Lecture Notes in Computer Science  
Conclusion Both generalization techniques are very suitable for mechanical transformation: all operators of the generalized programs are operators of the initial programs.  ...  Given a divide-and-conquer program, a mere inspection of the properties of its solving, processing, and composition operators thus allows the detection of which kinds of generalization are possible, and  ...  R(X,Y) ← Rs([X], flat(void,[]) flat(btree(L,E,R),F) ← flat(L,U), flat(R,V), H=[E], append(U,V,I), append(H,I,F) Tupling generalization yields: flats(Bs,F) holds iff list F is the concatenation of the prefix  ... 
doi:10.1007/3-540-60939-3_13 fatcat:goooqsi3nzgxvm5miongnxyaum

A generic analysis environment for declarative programs

Michael Hanus
2005 Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming - WCFLP '05  
Curry-Browser is completely implemented in Curry using libraries for GUI programming and meta-programming.  ...  In order to support the integration of various program analyses, CurryBrowser has a generic interface to connect local and global analyses implemented in Curry.  ...  Since flat programs are an appropriate abstraction level for implementing such tools [10, 11] , this interface is based on them.  ... 
doi:10.1145/1085099.1085108 dblp:conf/wcflp/Hanus05 fatcat:pzmjjj223bffrddp6bknvd6yka

Hierarchical phasers for scalable synchronization and reductions in dynamic parallelism

Jun Shirako, Vivek Sarkar
2010 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)  
Major crossroads in computer industry Processor clock speeds are no longer increasing ⇒ Chips with increasing # cores instead Challenge for software enablement on future systems 100 and more cores on a  ...  chip Productivity and efficiency of parallel programming Need for new programming model  ...  > OMP-for ≈ OMP-barrier > phaser Tree-based phaser is faster than flat phaser when # threads ≥ 16 Barrier + Reduction with EPCC Syncbench on Sun 128-thread Niagara T2 22 ., "Performance analysis  ... 
doi:10.1109/ipdps.2010.5470414 dblp:conf/ipps/ShirakoS10 fatcat:rhcppja64jfkvb7cbchswpgvya

Generators-of-Generators Library with Optimization Capabilities in Fortress [chapter]

Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Kiminori Matsuzaki, Masato Takeichi
2010 Lecture Notes in Computer Science  
A program developed with these GoGs is automatically optimized, even in asymptotic complexity, by the optimization mechanism in the library.  ...  To resolve difficulties in parallel programming, a large number of studies are conducted on parallel skeletons and optimization theorems over skeleton programs.  ...  Composing Parallel Skeletons to Make Naive Program We introduce the following parallel skeletons [2, 14] on lists to describe a naive parallel program.  ... 
doi:10.1007/978-3-642-15291-7_4 fatcat:423lgkdfazag3lkptkohls63wy

Towards Model-Checking Programs with Lists [chapter]

Alain Finkel, Étienne Lozes, Arnaud Sangnier
2009 Lecture Notes in Computer Science  
We then study the decidability of these two problems considering some restricted classes of programs, namely flat programs without destructive update.  ...  We aim at checking safety and temporal properties over models representing the behavior of programs manipulating dynamic singly-linked lists.  ...  with at most one cyclic list.  ... 
doi:10.1007/978-3-642-03092-5_6 fatcat:jso5f5fmxzclplmx3tmzsyoskm

A Generic Analysis Environment for Curry Programs [article]

Michael Hanus
2007 arXiv   pre-print
CurryBrowser is completely implemented in Curry using libraries for GUI programming and meta-programming.  ...  CurryBrowser supports browsing through the program code of an application written in Curry, i.e., the main module and all directly or indirectly imported modules.  ...  Since flat programs are an appropriate abstraction level for implementing such tools [8, 15, 16] , this interface is based on them.  ... 
arXiv:cs/0701147v1 fatcat:cdfmj5wyvbgutcse64rz7bfd5u

Synthesizing Structured CAD Models with Equality Saturation and Inverse Transformations [article]

Chandrakana Nandi, Max Willsey, Adam Anderson, James R. Wilcox, Eva Darulova, Dan Grossman, Zachary Tatlock
2020 arXiv   pre-print
We present Szalinski, a tool that uses Equality Saturation with semantics-preserving CAD rewrites to efficiently search for smaller equivalent programs.  ...  This paper proposes a second decompilation stage to robustly "shrink" unstructured CSG expressions into more editable programs with map and fold operators.  ...  (introduced in Section 1), and run Szalinski on these flat CSGs, (2) to analyze the scalability, correctness and efficiency of Szalinski on large-scale real world programs.  ... 
arXiv:1909.12252v3 fatcat:3iyruhuydjdmzhte4vnxpazfdi

A Note on the Implementation of LITHP on the I.C.T. 1905

P. Hammersley
1966 Computer journal  
The program does not require any other blocks to be supplied with it.  ...  Secondly, the advantages of magnetic tape with fixed size, pre-addressed blocks, as used on Atlas.  ... 
doi:10.1093/comjnl/9.2.173 fatcat:fqcm6i6h5jdidjvvy5sh2unnza

Haskell Boards the Ferry [chapter]

George Giorgidze, Torsten Grust, Tom Schreiber, Jeroen Weijers
2011 Lecture Notes in Computer Science  
Programming with the expressive list comprehension notation is also supported. The library, in addition to queries of basic types, supports computations over arbitrarily nested tuples and lists.  ...  Data-intensive and data-parallel computations are expressed using familiar combinators from the standard list prelude and are entirely executed on the database coprocessor.  ...  The Links system only supports database execution of program fragments that deal with flat data.  ... 
doi:10.1007/978-3-642-24276-2_1 fatcat:iakpaden2jccxf4n4dkedxtvou

Advanced X-Ray Astrophysics Facility (AXAF)

Martin C. Weisskopf, Stephen L. O'Dell, Leon P. Van Speybroeck, Richard B. Hoover, Arthur B. C. Walker II
1996 Multilayer and Grazing Incidence X-Ray/EUV Optics III  
Measurements with •UM al. SAO•-AL1F-82-012. September 1982. Description and results of high resolution 1-ray scattering measurements made on AIAF test flats at MSFC.  ...  AW Test Flat Listing of Formal Briefings Phase A ftfereace Concert, MSFC/SAO, November 1980.  ... 
doi:10.1117/12.245079 fatcat:4tinzzs5jres5kx4or5ejumk7a

The advanced X-ray Astrophysics Facility (AXAF)

Claude R. Canizares
1990 Advances in Space Research  
AW Test Flat Measurements with •UM al. SAO•-AL1F-82-012. September 1982. Description and results of high resolution 1-ray scattering measurements made on AIAF test flats at MSFC.  ...  Stylus Measurements it AF Tsst Flats, SAO-AXAF-82-011, September 1982. Results sad interpretation of National Bureau of Standards (NBS) Talystep measurements on AL1F test flats.  ... 
doi:10.1016/0273-1177(90)90151-o fatcat:gnszbpbsubamtipkcsosvmizdm

Concept Learning by Experiment

Claude Sammut
1981 International Joint Conference on Artificial Intelligence  
Once "reverse" is known, the system can actually perform a list reversal on given input data.  ...  The program passively accepts its input and otherwise does not interact with the environment. Furthermore, It Is expected that the concept will be learnt in one session.  ... 
dblp:conf/ijcai/Sammut81 fatcat:723nafxmrbaxlgbetttuh62rmm

Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities

Emanuel Kitzelmann, Ute Schmid
2007 Electronical Notes in Theoretical Computer Science  
In this paper we present theoretical results and describe an algorithm for inducing CSs over arbitrary signatures/data types which consist of one function defined by an arbitrary number of rules with an  ...  Induction is based on detecting syntactic regularities between example terms.  ...  The experiments were performed on a Pentium 4 with Linux and the program runs are interpreted with the Maude 2.2 interpreter.  ... 
doi:10.1016/j.entcs.2006.11.015 fatcat:urwwboklbvfmhmnn26ijkwb3iu
« Previous Showing results 1 — 15 out of 327,953 results