Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Análisis programa")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1376

  • Page / 56
Export

Selection :

  • and

Efficient deductive methods for program analysisGANZINGER, Harald.ACM SIGPLAN notices. 2001, Vol 36, Num 3, pp 102-103, issn 1523-2867Conference Paper

A comparative analysis of dependence testing mechanismsHOEFLINGER, Jay; PAEK, Yunheung.Lecture notes in computer science. 2001, pp 289-303, issn 0302-9743, isbn 3-540-42862-3Conference Paper

Algorithm explanation: Visualizing abstract states and invariantsWILHELM, Reinhard; MÜLDNER, Tomasz; SEIDEL, Raimund et al.Lecture notes in computer science. 2002, pp 381-394, issn 0302-9743, isbn 3-540-43323-6Conference Paper

Bottom-up deduction with deletion and prioritiesGANZINGER, Harald.Lecture notes in computer science. 2001, pp 276-277, issn 0302-9743, isbn 3-540-42068-1Conference Paper

Finding free schedules for non-uniform loopsBELETSKYY, Volodymyr; SIEDLECKI, Krzysztof.Lecture notes in computer science. 2003, pp 297-302, issn 0302-9743, isbn 3-540-40788-X, 6 p.Conference Paper

A language and system for constructing and presenting low fidelity algorithm visualizationsHUNDHAUSEN, Christopher; DOUGLAS, Sarah.Lecture notes in computer science. 2002, pp 227-240, issn 0302-9743, isbn 3-540-43323-6Conference Paper

AVTA 2004 : automated technology for verification and analysis (Taipei, 31 October - 3 November 2004)Wang, Farn.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-23610-4, XII, 506 p, isbn 3-540-23610-4Conference Proceedings

Understanding modifications in state-based modelsKOREL, Bogdan; TAHAT, Luay H.International Workshop on Program Comprehension. 2004, pp 246-250, isbn 0-7695-2149-5, 1Vol, 5 p.Conference Paper

Animating algorithms live and post mortemDIEHL, Stephan; GÖRG, Carsten; KERREN, Andreas et al.Lecture notes in computer science. 2002, pp 46-57, issn 0302-9743, isbn 3-540-43323-6Conference Paper

Efficient points-to analysis for Whole-program analysisDONGLIN LIANG; HARROLD, M. J.Lecture notes in computer science. 1999, pp 199-215, issn 0302-9743, isbn 3-540-66538-2Conference Paper

Data dependences as abstract interpretationsTZOLOVSKI, S.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63468-1, p. 366Conference Paper

An abstract interpretation framework for optimizing dynamic modular logic languagesCIAMPOLINI, A; LAMMA, E; MELLO, P et al.Information processing letters. 1996, Vol 58, Num 4, pp 163-170, issn 0020-0190Article

PEPM'94 : 1994 ACM SIGPLAN workshop on partial evaluation and semantics-based program manipulationSESTOFT, Peter; SØNDERGAARD, Harald.Lisp and symbolic computation. 1995, Vol 8, Num 3, pp 189-285, issn 0892-4635Conference Proceedings

Automated technology for verification and analysis (Third international symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, proceedings)Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-29209-8, 1Vol, XII, 506 p, isbn 3-540-29209-8Conference Proceedings

A conceptual framework for analyzing the use of context in groupwareROSA, Marcio G. P; BORGES, Marcos R. S; SANTORO, Flavia M et al.Lecture notes in computer science. 2003, pp 300-313, issn 0302-9743, isbn 3-540-20117-3, 14 p.Conference Paper

The essence of computation (complexity, analysis, transformation)Jones, Neil D; Mogensen, Torben Æ; Schmidt, David A et al.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-00326-6, XIV, 473 p, isbn 3-540-00326-6Book

Parameterizing a groundness analysis of logic programsLUNJIN LU.Lecture notes in computer science. 2001, pp 146-164, issn 0302-9743, isbn 3-540-42314-1Conference Paper

Efficient computation of parameterized pointer information for interprocedural analysesDONGLIN LIANG; HARROLD, Mary Jean.Lecture notes in computer science. 2001, pp 279-298, issn 0302-9743, isbn 3-540-42314-1Conference Paper

Combining forward and backward analyses of temporal propertiesMASSE, Damien.Lecture notes in computer science. 2001, pp 103-116, issn 0302-9743, isbn 3-540-42068-1Conference Paper

Variable precision reaching definitions analysis for software maintenanceTONELLA, P; ANTONIOL, G; FIUTEM, R et al.Euromicro conference on software maintenance and reengineering. 1997, pp 60-67, isbn 0-8186-7892-5Conference Paper

On the sequential nature of interprocedural program-analysis problemsREPS, T.Acta informatica. 1996, Vol 33, Num 8, pp 739-757, issn 0001-5903Article

Effective strictness analysis with horn constraintsGLYNN, Kevin; STUCKEY, Peter J; SULZMANN, Martin et al.Lecture notes in computer science. 2001, pp 73-92, issn 0302-9743, isbn 3-540-42314-1Conference Paper

Higher-precision groundness analysisCODISH, Michael; GENAIM, Samir; SØNDERGAARD, Harald et al.Lecture notes in computer science. 2001, pp 135-149, issn 0302-9743, isbn 3-540-42935-2Conference Paper

Checking progress with action priority : Is it fair?GIANNAKOPOULOU, D; MAGEE, J; KRAMER, J et al.Lecture notes in computer science. 1999, pp 511-527, issn 0302-9743, isbn 3-540-66538-2Conference Paper

An introduction to OCEANS projectWIJSHOFF, H. A. G.Lecture notes in computer science. 1999, pp 5-6, issn 0302-9743, isbn 3-540-65969-2Conference Paper

  • Page / 56